Rationalizability in continuous games

Itai Arieli

Journal of Mathematical Economics, 2010, vol. 46, issue 5, 912-924

Abstract: Define a continuous game to be one in which every player's strategy set is a Polish space, and the payoff function of each player is bounded and continuous. We prove that in this class of games the process of sequentially eliminating "never-best-reply" strategies terminates before or at the first uncountable ordinal, and this bound is tight. Also, we examine the connection between this process and common belief of rationality in the universal type space of Mertens and Zamir (1985).

Keywords: Rationalizability; Continuous; games (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304-4068(10)00079-0
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:mateco:v:46:y:2010:i:5:p:912-924

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().