We formalise a notion of dynamic rationality in terms of a logic of conditional beliefs on plausibility models. Similarly to other epistemic statements, dynamic rationality changes its meaning after every act of learning, and it may become true after players learn it is false. Applying this to extensive games, we "simulate" the play of a game as a succession of dynamic updates of the original plausibility model: the epistemic situation when a given node is reached can be thought of as (...) the result of a joint act of learning that the node is reached. We then use the notion of "stable belief, i.e. belief that is preserved during the play of the game, in order to give an epistemic condition for backward induction: rationality and common knowledge of stable belief in rationality. This condition is weaker than Aumann's and compatible with the implicit assumptions underlying Stalnaker's criticism of Aumann's proof. The "dynamic" nature of our concept of rationality explains why our condition avoids the apparent circularity of the "backward induction paradox": it is consistent to believe in a player's rationality after updating with his irrationality. (shrink)

This commentary focuses on the parts of psychological game theory dealing with preference, as illustrated by team reasoning, and supports the conclusion that these theoretical notions do not contribute above and beyond existing theory in understanding social interaction. In particular, psychology and games are already bridged by a comprehensive, formal, and inherently psychological theory, interdependence theory (Kelley & Thibaut 1978; Kelley et al. 2003), which has been demonstrated to account for a wide variety of social interaction phenomena.

We present an axiomatic approach for a class of finite, extensive form games of perfect information that makes use of notions like “rationality at a node” and “knowledge at a node.” We distinguish between the game theorist's and the players' own “theory of the game.” The latter is a theory that is sufficient for each player to infer a certain sequence of moves, whereas the former is intended as a justification of such a sequence of moves. While in general the (...) game theorist's theory of the game is not and need not be axiomatized, the players' theory must be an axiomatic one, since we model players as analogous to automatic theorem provers that play the game by inferring (or computing) a sequence of moves. We provide the players with an axiomatic theory sufficient to infer a solution for the game (in our case, the backwards induction equilibrium), and prove its consistency. We then inquire what happens when the theory of the game is augmented with information that a move outside the inferred solution has occurred. We show that a theory that is sufficient for the players to infer a solution and still remains consistent in the face of deviations must be modular. By this we mean that players have distributed knowledge of it. Finally, we show that whenever the theory of the game is group-knowledge (or common knowledge) among the players (i.e., it is the same at each node), a deviation from the solution gives rise to inconsistencies and therefore forces a revision of the theory at later nodes. On the contrary, whenever a theory of the game is modular, a deviation from equilibrium play does not induce a revision of the theory. (shrink)

The problem of finding sufficient doxastic conditions for backward induction in games of perfect information is analyzed in a syntactic framework with subjunctive conditionals. This allows to describe the structure of the game by a logical formula and consequently to treat beliefs about this structure in the same way as beliefs about rationality. A backward induction and a non-Nash equilibrium result based on higher level belief in rationality and the structure of the game are derived.

Rational choice theory enjoys unprecedented popularity and influence in the behavioral and social sciences, but it generates intractable problems when applied to socially interactive decisions. In individual decisions, instrumental rationality is defined in terms of expected utility maximization. This becomes problematic in interactive decisions, when individuals have only partial control over the outcomes, because expected utility maximization is undefined in the absence of assumptions about how the other participants will behave. Game theory therefore incorporates not only rationality but also common (...) knowledge assumptions, enabling players to anticipate their co-players' strategies. Under these assumptions, disparate anomalies emerge. Instrumental rationality, conventionally interpreted, fails to explain intuitively obvious features of human interaction, yields predictions starkly at variance with experimental findings, and breaks down completely in certain cases. In particular, focal point selection in pure coordination games is inexplicable, though it is easily achieved in practice; the intuitively compelling payoff-dominance principle lacks rational justification; rationality in social dilemmas is self-defeating; a key solution concept for cooperative coalition games is frequently inapplicable; and rational choice in certain sequential games generates contradictions. In experiments, human players behave more cooperatively and receive higher payoffs than strict rationality would permit. Orthodox conceptions of rationality are evidently internally deficient and inadequate for explaining human interaction. Psychological game theory, based on nonstandard assumptions, is required to solve these problems, and some suggestions along these lines have already been put forward. Key Words: backward induction; Centipede game; common knowledge; cooperation; epistemic reasoning; game theory; payoff dominance; pure coordination game; rational choice theory; social dilemma. (shrink)

Backward induction was one of the earliest methods developed for solving finite sequential games with perfect information. It proved to be especially useful in the context of Tom Schelling’s ideas of credible versus incredible threats. BI can be also extended to solve complex games that include an infinite number of actions or an infinite number of periods. However, some more complex empirical or experimental predictions remain dramatically at odds with theoretical predictions obtained by BI. The primary example of such a (...) troublesome game is Centipede. The problems appear in other long games with sufficiently complex structure. BI also shares the problems of subgame perfect equilibrium and fails to eliminate certain unreasonable Nash equilibria. (shrink)

Dov Gabbay is a prolific logician just by himself. But beyond that, he is quite good at making other people investigate the many further things he cares about. As a result, King's College London has become a powerful attractor in our field worldwide. Thus, it is a great pleasure to be an organizer for one of its flagship events: the Augustus de Morgan Workshop of 2005. Benedikt Loewe and I proposed the topic of 'interactive logic' for this occasion, with an (...) emphasis on social software – the logical analysis and design of social procedures – and on games, arguably the formal interactive setting par excellence. This choice reflects current research interests in our logic community at ILLC Amsterdam and beyond. In this broad area of interfaces between logic, computer science, and game theory, this paper is my own attempt at playing Dov. I am, perhaps not telling, but at least asking other people to find out for me what I myself cannot. (shrink)

Subjunctive conditionals are fundamental to rational decision both in single agent and multiple agent decision problems. They need explicit analysis only when they cause problems, as they do in recent discussions of rationality in extensive form games. This paper examines subjunctive conditionals in the theory of games using a strict revealed preference interpretation of utility. Two very different models of games are investigated, the classical model and the limits of reality model. In the classical model the logic of backward induction (...) is valid, but it does not use subjunctive conditionals; the relevant subjunctive conditionals do not even make sense. In the limits of reality model the subjunctive conditionals do make sense but backward induction is valid only under special assumptions. (shrink)

Two justifications of backward induction (BI) in generic perfect information games are formulated using Bonanno's (1992; Theory and Decision 33, 153) belief systems. The first justification concerns the BI strategy profile and is based on selecting a set of rational belief systems from which players have to choose their belief functions. The second justification concerns the BI path of play and is based on a sequential deletion of nodes that are inconsistent with the choice of rational belief functions.

In certain finite extensive games with perfect information, Cristina Bicchieri (1989) derives a logical contradiction from the assumptions that players are rational and that they have common knowledge of the theory of the game. She argues that this may account for play outside the Nash equilibrium. She also claims that no inconsistency arises if the players have the minimal beliefs necessary to perform backward induction. We here show that another contradiction can be derived even with minimal beliefs, so there is (...) no paradox of common knowledge specifically. These inconsistencies do not make play outside Nash equilibrium plausible, but rather indicate that the epistemic specification must incorporate a system for belief revision. Whether rationality is common knowledge is not the issue. (shrink)