Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques

DOI10.1007/978-3-642-33996-7_9zbMath1284.91017OpenAlexW207653415MaRDI 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

Mathematics Subject Classification ID

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

This page was built for publication: Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques