Lower bounds for the query complexity of equilibria in Lipschitz games
Work
Year: 2023
Type: article
Abstract: Nearly a decade ago, Azrieli and Shmaya introduced the class of λ-Lipschitz games in which every player's payoff function is λ-Lipschitz with respect to the actions of the other players. They showed t... more
Source: Theoretical Computer Science
Authors Paul W. Goldberg, Matthew J. Katzman
Institution University of Oxford
Cites: 18
Cited by: 1
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Topic: Game Theory and Applications
Field: Decision Sciences
Domain: Social Sciences
Open Access status: hybrid
APC paid (est): $2,690