Uniform Proofs of Order Independence for Various Strategy Elimination Procedures
classification
💻 cs.GT
cs.LO
keywords
proofsdominanceeliminationindependenceorderproceduresstrategyuniform
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.