@inproceedings{f63b983e49bd4c4f950f278df04aa69c,

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 = "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",

}