Thumbnail
Access Restriction
Subscribed

Author Babichenko, Yakov
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2016
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Query complexity ♦ Adaptive dynamics ♦ Approximate Nash equilibrium ♦ Rate of convergence
Abstract We study the query complexity of approximate notions of Nash equilibrium in games with a large number of players $\textit{n}.$ Our main result states that for $\textit{n}-player$ binary-action games and for constant ϵ, the query complexity of an ϵ-well-supported Nash equilibrium is exponential in $\textit{n}.$ As a consequence of this result, we get an exponential lower bound on the rate of convergence of adaptive dynamics to approximate Nash equilibria.
Description Author Affiliation: Technion, Israel Institute of Technology, Haifa, Israel (Babichenko, Yakov)
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2016-10-10
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 63
Issue Number 4
Page Count 24
Starting Page 1
Ending Page 24


Open content in new tab

   Open content in new tab
Source: ACM Digital Library