Query complexity of approximate Nash equilibria

Yakov Babichenko

doi:https://doi.org/10.1145/2591796.2591829

Query complexity of approximate Nash equilibria

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study the query complexity of approximate notions of Nash equilibrium in games with a large number of players n and a constant number of actions m. Our main result states that even for constant ε, the query complexity of an ε-well-supported Nash equilibrium is exponential in n.

Original language	English
Title of host publication	STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing
Pages	535-544
Number of pages	10
DOIs	https://doi.org/10.1145/2591796.2591829
State	Published - 2014
Externally published	Yes
Event	4th Annual ACM Symposium on Theory of Computing, STOC 2014 - New York, NY, United States Duration: 31 May 2014 → 3 Jun 2014

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing

Conference

Conference	4th Annual ACM Symposium on Theory of Computing, STOC 2014
Country/Territory	United States
City	New York, NY
Period	31/05/14 → 3/06/14

Keywords

Adaptive dynamics
Approximate Nash equilibrium
Fixed point
Query complexity
Rate of convergence

All Science Journal Classification (ASJC) codes

Software

Access to Document

https://doi.org/10.1145/2591796.2591829

Cite this

@inproceedings{e764c13449fe4c209475efe157013add,

title = "Query complexity of approximate Nash equilibria",

abstract = "We study the query complexity of approximate notions of Nash equilibrium in games with a large number of players n and a constant number of actions m. Our main result states that even for constant ε, the query complexity of an ε-well-supported Nash equilibrium is exponential in n.",

keywords = "Adaptive dynamics, Approximate Nash equilibrium, Fixed point, Query complexity, Rate of convergence",

author = "Yakov Babichenko",

year = "2014",

doi = "https://doi.org/10.1145/2591796.2591829",

language = "الإنجليزيّة",

isbn = "9781450327107",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

pages = "535--544",

booktitle = "STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing",

note = "4th Annual ACM Symposium on Theory of Computing, STOC 2014 ; Conference date: 31-05-2014 Through 03-06-2014",

}

TY - GEN

T1 - Query complexity of approximate Nash equilibria

AU - Babichenko, Yakov

PY - 2014

Y1 - 2014

N2 - We study the query complexity of approximate notions of Nash equilibrium in games with a large number of players n and a constant number of actions m. Our main result states that even for constant ε, the query complexity of an ε-well-supported Nash equilibrium is exponential in n.

AB - We study the query complexity of approximate notions of Nash equilibrium in games with a large number of players n and a constant number of actions m. Our main result states that even for constant ε, the query complexity of an ε-well-supported Nash equilibrium is exponential in n.

KW - Adaptive dynamics

KW - Approximate Nash equilibrium

KW - Fixed point

KW - Query complexity

KW - Rate of convergence

UR - http://www.scopus.com/inward/record.url?scp=84904315554&partnerID=8YFLogxK

U2 - https://doi.org/10.1145/2591796.2591829

DO - https://doi.org/10.1145/2591796.2591829

M3 - منشور من مؤتمر

SN - 9781450327107

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 535

EP - 544

BT - STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing

T2 - 4th Annual ACM Symposium on Theory of Computing, STOC 2014

Y2 - 31 May 2014 through 3 June 2014

ER -

Query complexity of approximate Nash equilibria

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this