Hierarchies of Belief and Interim Rationalizability

Arbeitspapier

In games with incomplete information, conventional hierarchies of belief are incomplete as descriptions of the players’ information for the purposes of determining a player’s behavior. We show by example that this is true for a variety of solution concepts. We then investigate what is essential about a player’s information to identify rationalizable behavior in any game. We do this by constructing the universal type space for rationalizability and characterizing the types in terms of their beliefs. Infinite hierarchies of beliefs over conditional beliefs, what we call delta-hierarchies, are what turn out to matter. We show that any two types in any two type spaces have the same rationalizable sets in all games if and only if they have the same delta-hierarchies.

Object Details

• Language: Englisch

References and Relationships

• Bibliographic citation: Series: Discussion Paper ; No. 1388

Classification and Topics

• Classification: Wirtschaft

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Ely, Jeffrey C. ; Peski, Marcin
• Event: Veröffentlichung
• (who): Northwestern University, Kellogg School of Management, Center for Mathematical Studies in Economics and Management Science
• (where): Evanston, IL
• (when): 2004

Further information

• Handle: http://hdl.handle.net/10419/221732
• Last update: 10.03.2025, 11:42 AM CET