1 December 2005, Computational Social Choice Seminar, Krzysztof Apt
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 and related results on the abstract reduction systems.
The talk is an account of the following article: K.R. Apt, ``Uniform Proofs of Order Independence for Various Strategy Elimination Procedures'', Contributions to Theoretical Economics, 4(1), Article 5, 48 pages, http://xxx.lanl.gov/abs/cs.GT/0403024.
For more information, please contact Ulle Endriss (ulle at illc.uva.nl).