On Iterated Dominance, Matrix Elimination, and Matched Paths

Felix Brandt, Felix Fischer & Markus Holzer
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...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.