Archives

Institute for Logic, Language and Computation


1 December 2005, Computational Social Choice Seminar, Krzysztof Apt

Speaker: Krzysztof Apt
Title: On the order of strategy elimination procedures in strategic games
Date: 1 December 2005
Time: 16:00
Location: Room P1.14, Euclides Building, Plantage Muidergracht 24, Amsterdam

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 ().


The websites of the UvA make use of cookiesThis site uses cookies More informationMore info Hide this message XHide X