Possibilistic Beliefs and Higher-Level Rationality
Author(s)Chen, Jing; Micali, Silvio; Pass, Rafael
Theory of Computation
MetadataShow full item record
We consider rationality and rationalizability for normal-form games of incomplete information in which the players have possibilistic beliefs about their opponents. In this setting, we prove that the strategies compatible with the players being level-k rational coincide with the strategies surviving a natural k-step iterated elimination procedure. We view the latter strategies as the (level-k) rationalizable ones in our possibilistic setting.