@inproceedings{5557166c582246168f5c844fa7ec99ae,

title = "Logarithmic query complexity for approximate Nash computation in large games",

abstract = "We investigate the problem of equilibrium computation for “large” n-player games where each player has two pure strategies. Large games have a Lipschitz-type property that no single player{\textquoteright}s utility is greatly affected by any other individual player{\textquoteright}s actions. In this paper, we assume that a player can change another player{\textquoteright}s payoff by at most 1/n by changing her strategy. We study algorithms having query access to the game{\textquoteright}s payoff function, aiming to find ε-Nash equilibria. We seek algorithms that obtain ε as small as possible, in time polynomial in n. Our main result is a randomised algorithm that achieves ε approaching 1/8 in a completely uncoupled setting, where each player observes her own payoff to a query, and adjusts her behaviour independently of other players{\textquoteright} payoffs/actions. O(log n) rounds/queries are required. We also show how to obtain a slight improvement over 1/8, by introducing a small amount of communication between the players.",

author = "Goldberg, {Paul W.} and Coss{\'i}o, {Francisco J.Marmolejo} and Wu, {Zhiwei Steven}",

year = "2016",

doi = "10.1007/978-3-662-53354-3_1",

language = "English (US)",

isbn = "9783662533536",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "3--14",

editor = "Martin Gairing and Rahul Savani",

booktitle = "Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings",

note = "9th International Symposium on Algorithmic Game Theory, SAGT 2016 ; Conference date: 19-09-2016 Through 21-09-2016",

}