Lower bounds for the query complexity of equilibria in Lipschitz games
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 that such games admit ϵ-approximate pure Nash equilibria for certain settings of ϵ and λ. They l...
| 主要な著者: | , |
|---|---|
| フォーマット: | Journal article |
| 言語: | English |
| 出版事項: |
Elsevier
2023
|