Rationalizability in continuous games |
| |
Authors: | Itai Arieli |
| |
Institution: | Center for the Study of Rationality, and Department of Mathematics, The Hebrew University of Jerusalem, Feldman Building, Givat-Ram, 91904 Jerusalem, Israel |
| |
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 |
本文献已被 ScienceDirect 等数据库收录! |
|