Common Knowledge of Rationality in Extensive Games
de Bruin, Boudewijn
Notre Dame J. Formal Logic, Tome 49 (2008) no. 1, p. 261-280 / Harvested from Project Euclid
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
Publié le : 2008-07-15
Classification:  common knowledge,  epistemic characterization theorem,  rationality,  03B42,  91A18,  91A26
@article{1216152550,
     author = {de Bruin, Boudewijn},
     title = {Common Knowledge of Rationality in Extensive Games},
     journal = {Notre Dame J. Formal Logic},
     volume = {49},
     number = {1},
     year = {2008},
     pages = { 261-280},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1216152550}
}
de Bruin, Boudewijn. Common Knowledge of Rationality in Extensive Games. Notre Dame J. Formal Logic, Tome 49 (2008) no. 1, pp.  261-280. http://gdmltest.u-ga.fr/item/1216152550/