Uniform Proofs of Order Independence for Various Strategy Elimination Procedures

Simple item page
dc.creatorApt, Krzysztof R.
dc.date2004-03-15
dc.date2004-09-28
dc.date.accessioned2026-07-07T03:21:01Z
dc.date.available2026-07-07T03:21:01Z
dc.descriptionWe 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.
dc.description48 pages
dc.identifierhttps://arxiv.org/abs/cs/0403024
dc.identifierhttp://arxiv.org/abs/cs/0403024
dc.identifierContributions to Theoretical Economics, Vol. 4: No. 1, Article 5, 2004, http://www.bepress.com/bejte/contributions/vol4/iss1/art5
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32042
dc.subjectComputer Science and Game Theory
dc.subjectLogic in Computer Science
dc.subjectJ.4
dc.titleUniform Proofs of Order Independence for Various Strategy Elimination Procedures
dc.typetext

Files

Collections

arXiv