The Computational Complexity of Weak Saddles

DOI10.1007/978-3-642-04645-2_22zbMath1262.91012OpenAlexW2119586820MaRDI QIDQ3648859

Felix Brandt, Felix Fischer, Markus Brill, Jan Hoffmann

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_22

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: The Computational Complexity of Weak Saddles