Branching time, perfect information games and backward induction
Games and Economic Behavior 36 (1):57-73 (2001)
| Abstract | The logical foundations of game-theoretic solution concepts have so far been explored within the con¯nes of epistemic logic. In this paper we turn to a di®erent branch of modal logic, namely temporal logic, and propose to view the solution of a game as a complete prediction about future play. The branching time framework is extended by adding agents and by de¯ning the notion of prediction. A syntactic characterization of backward induction in terms of the property of internal consistency of prediction is given | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesHoracio Arló-Costa & Cristina Bicchieri (2007). Knowing and Supposing in Games of Perfect Information. Studia Logica 86 (3):353 - 373.
Boudewijn de Bruin (2008). Common Knowledge of Rationality in Extensive Games. Notre Dame Journal of Formal Logic 49 (3):261-280.
Matt Farr (2012). On A- and B-Theoretic Elements of Branching Spacetimes. Synthese 188 (1):85-116.
Cristina Bicchieri (1988). Backward Induction Without Common Knowledge. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:329 - 343.
Thorsten Clausing (2004). Belief Revision in Games of Perfect Information. Economics and Philosophy 20 (1):89-115.
Thorsten Clausing (2003). Doxastic Conditions for Backward Induction. Theory and Decision 54 (4):315-336.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads6 ( #145,546 of 549,067 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
