Cover Image

Query Complexity of Approximate Nash Equilibria

We study the query complexity of approximate notions of Nash equilibrium in games with large number of players n and constant number of actions m. Our main result states that even for constant {\epsilon}, the query complexity of {\epsilon}-well supported Nash equilibrium is exponential in n.
Year of publication:
2013-06
Authors: Babichenko, Yakov
Institutions: arXiv.org
Extent:
application/pdf
Series:
Type of publication: Book / Working Paper
Source:
Persistent link: https://www.econbiz.de/10010672371
Similar items by person