On the Complexity of Iterated Weak Dominance in Constant-Sum Games

DOI10.1007/978-3-642-04645-2_26zbMath1262.91005OpenAlexW2115920684MaRDI QIDQ3648864

Markus Brill, Paul Harrenstein, Felix Brandt, Felix Fischer

Publication date: 1 December 2009

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04645-2_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

The computational complexity of weak saddles

This page was built for publication: On the Complexity of Iterated Weak Dominance in Constant-Sum Games