Home Uniform Proofs of Order Independence for Various Strategy Elimination Procedures
Article
Licensed
Unlicensed Requires Authentication

Uniform Proofs of Order Independence for Various Strategy Elimination Procedures

  • Krzysztof R. Apt
Published/Copyright: September 27, 2004

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.

Published Online: 2004-9-27

©2011 Walter de Gruyter GmbH & Co. KG, Berlin/Boston

Downloaded on 30.10.2025 from https://www.degruyterbrill.com/document/doi/10.2202/1534-5971.1141/html?lang=en
Scroll to top button