Query Complexity of Approximate Equilibria in Anonymous Games

DOI10.1007/978-3-662-48995-6_26zbMath1404.91009OpenAlexW1554884927MaRDI QIDQ3460801

Paul W. Goldberg, Stefano Turchetta

Publication date: 8 January 2016

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48995-6_26

zbMATH Keywords

query complexitycomputation of equilibriatwo-strategy anonymous games

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (3)

Logarithmic query complexity for approximate Nash computation in large games ⋮ Logarithmic Query Complexity for Approximate Nash Computation in Large Games ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Sparse covers for sums of indicators
• Symmetries and the complexity of pure Nash equilibrium
• The query complexity of correlated equilibria
• Approximate Nash equilibria in anonymous games
• Best-reply dynamics in large binary-choice anonymous games
• On the Complexity of Nash Equilibria in Anonymous Games
• Multiagent Learning in Large Anonymous Games
• On the Complexity of Nash Equilibria and Other Fixed Points
• Settling the complexity of computing two-player Nash equilibria
• Lipschitz Games
• On oblivious PTAS's for nash equilibrium
• The Complexity of Computing a Nash Equilibrium
• Query complexity of approximate nash equilibria
• An Efficient PTAS for Two-Strategy Anonymous Games

This page was built for publication: Query Complexity of Approximate Equilibria in Anonymous Games