A dynamic epistemic characterization of backward induction without counterfactuals
The analysis of rational play in dynamic games is usually done within a static framework that specifies a player's initial beliefs as well as his disposition to revise those beliefs conditional on hypothetical states of information. We suggest a simpler approach, where the rationality of a player's choice is judged on the basis of the actual beliefs that the player has at the time he has to make that choice. We propose a dynamic framework where the set of "possible worlds" is given by state-instant pairs (w,t). Each state w specifies the entire play of the game and, for every instant t, (w,t) specifies the history that is reached at that instant (in state w). A player is said to be active at (w,t) if the history reached in state w at date t is a decision history of his. At every state-instant pair (w,t) the beliefs of the active player provide an answer to the question "what will happen if I take action a", for every available action a. A player is said to be rational at (w,t) if either he is not active there or the action he ends up taking at state w is "optimal" given his beliefs at (w,t). We provide a characterization of backward induction in terms of the following event: the first mover (i) is rational and has correct beliefs, (ii) believes that the active player at date 1 is rational and has correct beliefs, (iii) believes that the active player at date 1 believes that the active player at date 2 is rational and has correct beliefs, etc. Thus our epistemic characterization does not rely on dispositional belief revision or on (objective or subjective) counterfactuals.
|Date of creation:||18 Mar 2012|
|Date of revision:|
|Contact details of provider:|| Postal: One Shields Ave., Davis, CA 95616-8578|
Phone: (530) 752-0741
Fax: (530) 752-9382
Web page: http://www.econ.ucdavis.edu
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Samet, Dov, 1996.
"Hypothetical Knowledge and Games with Perfect Information,"
Games and Economic Behavior,
Elsevier, vol. 17(2), pages 230-251, December.
- Dov Samet, 1994. "Hypothetical Knowledge and Games with Perfect Information," Game Theory and Information 9408001, EconWPA, revised 17 Aug 1994.
- Feinberg, Yossi, 2005. "Subjective reasoning--dynamic games," Games and Economic Behavior, Elsevier, vol. 52(1), pages 54-93, July.
- Itzhak Gilboa, 1993.
"Can Free Choice Be Known?,"
1055, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Pierpaolo Battigalli & Alfredo Di Tillio & Dov Samet, 2011. "Strategies and interactive beliefs in dynamic games," Working Papers 375, IGIER (Innocenzo Gasparini Institute for Economic Research), Bocconi University.
- Pierpaolo Battigali & Giacomo Bonanno, .
"Recent Results On Belief, Knowledge And The Epistemic Foundations Of Game Theory,"
Department of Economics
98-14, California Davis - Department of Economics.
- Battigalli, Pierpaolo & Bonanno, Giacomo, 1999. "Recent results on belief, knowledge and the epistemic foundations of game theory," Research in Economics, Elsevier, vol. 53(2), pages 149-225, June.
- Giacomo Bonanno & Pierpaolo Battigalli, 2003. "Recent Results On Belief, Knowledge And The Epistemic Foundations Of Game Theory," Working Papers 9814, University of California, Davis, Department of Economics.
- Stalnaker, Robert, 1996. "Knowledge, Belief and Counterfactual Reasoning in Games," Economics and Philosophy, Cambridge University Press, vol. 12(02), pages 133-163, October.
- Perea,Andrés, 2012. "Epistemic Game Theory," Cambridge Books, Cambridge University Press, number 9781107401396, November.
- Stalnaker, Robert, 1998. "Belief revision in games: forward and backward induction1," Mathematical Social Sciences, Elsevier, vol. 36(1), pages 31-56, July.
- Thorsten Clausing, 2003. "Doxastic Conditions for Backward Induction," Theory and Decision, Springer, vol. 54(4), pages 315-336, June.
- Joseph Y. Halpern, 2000.
"Substantive Rationality and Backward Induction,"
Game Theory and Information
- Battigalli, Pierpaolo & Siniscalchi, Marciano, 2002. "Strong Belief and Forward Induction Reasoning," Journal of Economic Theory, Elsevier, vol. 106(2), pages 356-391, October.
- Elchanan Ben-Porath, 1997. "Rationality, Nash Equilibrium and Backwards Induction in Perfect-Information Games," Review of Economic Studies, Oxford University Press, vol. 64(1), pages 23-46.
- Aumann, Robert J., 1995. "Backward induction and common knowledge of rationality," Games and Economic Behavior, Elsevier, vol. 8(1), pages 6-19.
- Adam Brandenburger, 2007. "The power of paradox: some recent developments in interactive epistemology," International Journal of Game Theory, Springer;Game Theory Society, vol. 35(4), pages 465-492, April.
- Balkenborg, Dieter & Winter, Eyal, 1997.
"A necessary and sufficient epistemic condition for playing backward induction,"
Journal of Mathematical Economics,
Elsevier, vol. 27(3), pages 325-345, April.
- Balkenborg, Dieter & Eyal Winter, 1995. "A Necessary and Sufficient Epistemic Condition for Playing Backward Induction," Discussion Paper Serie B 331, University of Bonn, Germany.
- Perea,Andrés, 2012. "Epistemic Game Theory," Cambridge Books, Cambridge University Press, number 9781107008915, November.
- Aumann, Robert J., 1998. "On the Centipede Game," Games and Economic Behavior, Elsevier, vol. 23(1), pages 97-105, April.
- Clausing, Thorsten, 2004. "Belief Revision In Games Of Perfect Information," Economics and Philosophy, Cambridge University Press, vol. 20(01), pages 89-115, April.
When requesting a correction, please mention this item's handle: RePEc:cda:wpaper:12-2. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Scott Dyer)
If references are entirely missing, you can add them using this form.