Algorithmic Characterization of Rationalizability in Extensive Form Games
We construct a dynamic epistemic model for extensive form games, which generates a hierarchy of beliefs for each player over her opponents` strategies and beliefs, and tells us how those beliefs will be revised as the game proceeds. We use the model to analyze the implications of the assumption that the players possess common (true) belief in rationality, thus extending the concept of rationalizability to extensive form games.
|Date of creation:||01 Mar 2003|
|Date of revision:|
|Contact details of provider:|| Postal: Manor Rd. Building, Oxford, OX1 3UQ|
Web page: http://www.economics.ox.ac.uk/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:oxf:wpaper:148. 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: (Monica Birds)
If references are entirely missing, you can add them using this form.