Nested Removal of Strictly Dominated Strategies in Infinite Games

Michele Crescenzi

Papers from arXiv.org

Abstract: We compare two procedures for the iterated removal of strictly dominated strategies. In the nested procedure, a strategy of a player is removed only if it is dominated by an unremoved strategy. The universal procedure is more comprehensive for it allows the removal of strategies that are dominated by previously removed ones. Outside the class of finite games, the two procedures may lead to different outcomes in that the universal one is always order independent while the other is not. Here we provide necessary and sufficient conditions for the equivalence of the two procedures. The conditions we give are variations of the bounded mechanisms from the literature on full implementation. The two elimination procedures are shown to be equivalent in quasisupermodular games as well as in games with compact strategy spaces and upper semicontinuous payoff functions. We show by example that order independence of the nested procedure is not sufficient for its being equivalent to the universal one.

Date: 2025-01, Revised 2025-02
New Economics Papers: this item is included in nep-gth and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2501.17685 Latest version (application/pdf)

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:arx:papers:2501.17685

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().