On Iterated Dominance, Matrix Elimination, and Matched Paths - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

On Iterated Dominance, Matrix Elimination, and Matched Paths


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.
Fichier principal
Vignette du fichier
brandt.pdf (210.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00455361 , version 1 (10-02-2010)


  • HAL Id : inria-00455361 , version 1


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⟩


74 View
375 Download


Gmail Facebook Twitter LinkedIn More