Abstract
Motivated by the desideratum of undominated dominators (Jackson, 1992), we provide a notion of iterated elimination of boundedly dominated strategies for (in)finite strategic games and a wide variety of dominance relations. By introducing a condition of forgetfulness-proofness, we establish the equivalence among the usual iterated dominance, our notion of iterated bounded dominance, and Gilboa, Kalai and Zemel’s (1990) procedure. We also investigate the connection of forgetfulness-proofness with other similar conditions in the literature.
Original language | English |
---|---|
Article number | 111360 |
Journal | Economics Letters |
Volume | 232 |
DOIs | |
Publication status | Published - Nov 2023 |