Uniform Proofs of Order Independence for Various Strategy Elimination Procedures
Krzysztof R. Apt
Abstract
We provide elementary and uniform proofs of order independence for various strategy elimination procedures for finite strategic games, both for dominance by pure and by mixed strategies. The proofs follow the same pattern and focus on the structural properties of the dominance relations. They rely on Newman's Lemma established in 1942 and related results on the abstract reduction systems.
Create a lesson
Related papers
A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities
Dimitris Fotakis, Charalampos Platanos, Thanos Tolias
Faster Verification of PJR+ via Mincuts
Drew Springham
Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
Lishang Xu, Guodong Ma, Pengcheng Weng et al.
A Logarithmic Regret Bound for Optimistic Hedge in General-Sum Games
Junsoo Ha
Condorcet-type properties of the linear ordering problem with ties
Daichi Kawashima, Noriyoshi Sukegawa
On Periodic and Aperiodic Optimal Strategies in Solvency Games
Quentin Guilmant, Florian Luca, Richard Mayr et al.