On Iterated Dominance, Matrix Elimination, and Matched Paths

Details On Iterated Dominance, Matrix Elimination, and Matched Paths On Iterated Dominance, Matrix Elimination, and Matched Paths

2010-01-04

arxiv.org/abs/1001.0529v2

Computer Science

Computer Science and Game Theory

12 pages, 3 figures, 27th International Symposium on Theoretical Aspects of Computer Science (STACS)

Scientific paper

We study computational problems arising from the iterated removal of weakly dominated actions in anonymous games. Our main result shows that it is NP-complete to decide whether an anonymous game with three actions can be solved via iterated weak dominance. The two-action case can be reformulated as a natural elimination problem on a matrix, the complexity of which turns out to be surprisingly difficult to characterize and ultimately remains open. We however establish connections to a matching problem along paths in a directed graph, which is computationally hard in general but can also be used to identify tractable cases of matrix elimination. We finally identify different classes of anonymous games where iterated dominance is in P and NP-complete, respectively.

Affiliated with

Also associated with

No associations

Rating

On Iterated Dominance, Matrix Elimination, and Matched Paths 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 On Iterated Dominance, Matrix Elimination, and Matched Paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Iterated Dominance, Matrix Elimination, and Matched Paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-7420