Prudent Rationalizability in Generalized Extensive-Form Games
We define an extensive-form analogue of iterated admissibility, called Prudent Rationalizability (PR). In each round of the procedure, for each information set of a player a surviving strategy of hers is required to be rational vis-a-vis a belief system with a full-support belief on the opponents' previously surviving strategies that reach that information set. Somewhat surprisingly, prudent rationalizable strategies may not refine the set of Extensive-Form Rationalizable (EFR) strategies (Pearce 1984). However, we prove that the paths induced by PR strategy-profiles (weakly) refine the set of paths induced by EFR strategies. PR applies also to generalized extensive-form games which model mutual unawareness of actions (Heifetz, Meier and Schipper, 2011a). We demonstrate the applicability of PR in the analysis of verifiable communication, and show that it yields the same, full information unraveling prediction as does the unique sequential equilibrium singled out by Milgrom and Roberts (1986); yet, we also show that under unawareness full unraveling might fail.
|Date of creation:||04 Apr 2011|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: (530) 752-0741
Fax: (530) 752-9382
Web page: http://www.econ.ucdavis.edu
More information through EDIRC
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.:
- Paul R. Milgrom & John Roberts, 1985.
"Relying on the Information of Interested Parties,"
Cowles Foundation Discussion Papers
749, Cowles Foundation for Research in Economics, Yale University.
- Dubey, Pradeep & Kaneko, Mamoru, 1984.
"Information patterns and Nash equilibria in extensive games: 1,"
Mathematical Social Sciences,
Elsevier, vol. 8(2), pages 111-139, October.
- Dubey, Pradeep & Kaneko, Mamoru, 1985. "Information patterns and Nash equilibria in extensive games -- II," Mathematical Social Sciences, Elsevier, vol. 10(3), pages 247-262, December.
- Pradeep Dubey & Mamoru Kaneko, 1983. "Information Patterns and Nash Equilibria in Extensive Games," Cowles Foundation Discussion Papers 676, Cowles Foundation for Research in Economics, Yale University.
- Asheim, Geir B. & Perea, Andres, 2005. "Sequential and quasi-perfect rationalizability in extensive games," Games and Economic Behavior, Elsevier, vol. 53(1), pages 15-42, October.
- Stahl, Dale O., 1995. "Lexicographic rationalizability and iterated admissibility," Economics Letters, Elsevier, vol. 47(2), pages 155-159, February.
- Pearce, David G, 1984. "Rationalizable Strategic Behavior and the Problem of Perfection," Econometrica, Econometric Society, vol. 52(4), pages 1029-50, July.
- Reny, Philip J, 1992. "Backward Induction, Normal Form Perfection and Explicable Equilibria," Econometrica, Econometric Society, vol. 60(3), pages 627-49, May.
- Battigalli, Pierpaolo & Siniscalchi, Marciano, 2002. "Strong Belief and Forward Induction Reasoning," Journal of Economic Theory, Elsevier, vol. 106(2), pages 356-391, October.
- Shimoji, Makoto & Watson, Joel, 1998. "Conditional Dominance, Rationalizability, and Game Forms," Journal of Economic Theory, Elsevier, vol. 83(2), pages 161-195, December.
- Battigalli, Pierpaolo, 1997. "On Rationalizability in Extensive Games," Journal of Economic Theory, Elsevier, vol. 74(1), pages 40-61, May.
When requesting a correction, please mention this item's handle: RePEc:cda:wpaper:11-4. 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.