Uniform Proofs of Order Independence for Various Strategy Elimination Procedures
A BEJTE Contributions article.
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.Submitted: March 12, 2004 · Accepted: September 22, 2004 · Published: September 27, 2004
Originally published in Contributions to Theoretical Economics.
Recommended Citation
Apt, Krzysztof R.
(2004)
"Uniform Proofs of Order Independence for Various Strategy Elimination Procedures,"
Contributions to Theoretical Economics:
Vol. 4
:
Iss.
1, Article 5.
Available at: http://www.bepress.com/bejte/contributions/vol4/iss1/art5
