Uniform Proofs of Order Independence for Various Strategy Elimination Procedures

Details Uniform Proofs of Order Independence for Various Strategy Elimination Procedures Uniform Proofs of Order Independence for Various Strategy Elimination Procedures

2004-03-15

arxiv.org/abs/cs/0403024v2

Contributions to Theoretical Economics, Vol. 4: No. 1, Article 5, 2004, http://www.bepress.com/bejte/contributions/vol4/iss1/a

Computer Science

Computer Science and Game Theory

48 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Uniform Proofs of Order Independence for Various Strategy Elimination Procedures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Uniform Proofs of Order Independence for Various Strategy Elimination Procedures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniform Proofs of Order Independence for Various Strategy Elimination Procedures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-701684