Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques
From MaRDI portal
Publication:4910937
DOI10.1007/978-3-642-33996-7_9zbMath1284.91017MaRDI QIDQ4910937
Kord Eickmeyer, Elad Verbin, Kristoffer Arnsfelt Hansen
Publication date: 13 March 2013
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33996-7_9
91A10: Noncooperative games
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
