On Iterated Dominance, Matrix Elimination, and Matched Paths

Abstract : 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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00455361
Contributor : Publications Loria <>
Submitted on : Wednesday, February 10, 2010 - 11:17:46 AM
Last modification on : Tuesday, February 12, 2019 - 3:14:23 PM
Long-term archiving on : Friday, June 18, 2010 - 7:53:49 PM

File

brandt.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00455361, version 1

Collections

Citation

Felix Brandt, Felix Fischer, Markus Holzer. On Iterated Dominance, Matrix Elimination, and Matched Paths. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.107-118. ⟨inria-00455361⟩

Share

Metrics

Record views

192

Files downloads

598