In classical game theory the idea that players randomize between their actions according to a particular optimal probability distribution has always been viewed as puzzling. In this paper, we establish a fundamental connection between n-person normal form games and quantum mechanics, which eliminates the conceptual problems of these random strategies. While the two theories have been regarded as distinct, our main theorem proves that if we do not give any other piece of information to a player in a game, than (...) the payoff matrix—the axiom of “no-supplementary data” holds—then the state of mind of a rational player is algebraically isomorphic to a pure quantum state. The “no supplementary data” axiom is captured in a Lukasiewicz’s three-valued Kripke semantics wherein statements about whether a strategy or a belief of a player is rational are initially indeterminate i.e. neither true, nor false. As a corollary, we show that in a mixed Nash equilibrium, the knowledge structure of a player implies that probabilities must verify the standard “Born rule” postulate of QM. The puzzling “indifference condition” wherein each player must be rationally indifferent between all the pure actions of the support of his equilibrium strategy is resolved by his state of mind being described by a “quantum superposition” prior a player is asked to make a definite choice in a “measurement”. Finally, these results demonstrate that there is an intrinsic limitation to the predictions of game theory, on a par with the “irreducible randomness” of quantum physics. (shrink)

We associate the semantic game with chance moves conceived by Blinov with Blamey’s partial logic. We give some equivalent alternatives to the semantic game, some of which are with a third player, borrowing the idea of introducing the pseudo-player called Nature in game theory. We observe that IF propositional logic proposed by Sandu and Pietarinen can be equivalently translated to partial logic, which implies that imperfect information may not be necessary for IF propositional logic. We also indicate that some independent (...) quantifiers can be regarded as dependent quantifiers of indeterminate sequence, using the interjunction connective in partial logic. We conclude our paper by indicating some further research in a more general setting. (shrink)

Charles Sanders Peirce was one of the United States’ most original and profound thinkers, and a prolific writer. Peirce’s game theory-based approaches to the semantics and pragmatics of signs and language, to the theory of communication, and to the evolutionary emergence of signs, provide a toolkit for contemporary scholars and philosophers. Drawing on unpublished manuscripts, the book offers a rich, fresh picture of the achievements of a remarkable man.

We develop a logical system that captures two different interpretations of what extensive games model, and we apply this to a long-standing debate in game theory between those who defend the claim that common knowledge of rationality leads to backward induction or subgame perfect (Nash) equilibria and those who reject this claim. We show that a defense of the claim à la Aumann (1995) rests on a conception of extensive game playing as a one-shot event in combination with a principle (...) of rationality that is incompatible with it, while a rejection of the claim à la Reny (1988) assumes a temporally extended, many-moment interpretation of extensive games in combination with implausible belief revision policies. In addition, the logical system provides an original inductive and implicit axiomatization of rationality in extensive games based on relations of dominance rather than the usual direct axiomatization of rationality as maximization of expected utility. (shrink)