TY - JOUR
T1 - Iterated bounded dominance
AU - Hsieh, Yue-Da
AU - Qian, Xuewen
AU - Qu, Chen
PY - 2023/11
Y1 - 2023/11
N2 - 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.
AB - 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.
UR - http://dx.doi.org/10.1016/j.econlet.2023.111360
U2 - 10.1016/j.econlet.2023.111360
DO - 10.1016/j.econlet.2023.111360
M3 - Article
SN - 0165-1765
VL - 232
JO - Economics Letters
JF - Economics Letters
M1 - 111360
ER -