License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2010.2448
URN: urn:nbn:de:0030-drops-24485
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2448/
Go to the corresponding Portal


Brandt, Felix ; Fischer, Felix ; Holzer, Markus

On Iterated Dominance, Matrix Elimination, and Matched Paths

pdf-format:
Document 1.pdf (300 KB)


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.

BibTeX - Entry

@InProceedings{brandt_et_al:LIPIcs:2010:2448,
  author =	{Felix Brandt and Felix Fischer and Markus Holzer},
  title =	{{On Iterated Dominance, Matrix Elimination, and Matched Paths}},
  booktitle =	{27th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{107--118},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-16-3},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{5},
  editor =	{Jean-Yves Marion and Thomas Schwentick},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2448},
  URN =		{urn:nbn:de:0030-drops-24485},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2448},
  annote =	{Keywords: Algorithmic Game Theory, Computational Complexity, Iterated Dominance, Matching}
}

Keywords: Algorithmic Game Theory, Computational Complexity, Iterated Dominance, Matching
Seminar: 27th International Symposium on Theoretical Aspects of Computer Science
Issue Date: 2010
Date of publication: 09.03.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI