Query complexity of approximate equilibria in anonymous games

DOI10.1007/978-3-662-48995-6_26MaRDI QIDQ3460801zbMATH OpenOpenAlexFDO

Authors Paul W. Goldberg, Stefano Turchetta

Publication date 8 January 2016

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

computation of equilibriaquery complexitytwo-strategy anonymous games

Mathematics Subject Classification ID

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

Recommendations

• Query complexity of approximate equilibria in anonymous games
• Query complexity of approximate Nash equilibria
• Query complexity of approximate nash equilibria
• Playing anonymous games using simple strategies
• On the complexity of Nash equilibria in anonymous games

Cites work

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

Cited in

(11)

• The query complexity of correlated equilibria
• Logarithmic query complexity for approximate Nash computation in large games
• Query complexity of approximate equilibria in anonymous games
• Logarithmic Query Complexity for Approximate Nash Computation in Large Games
• On the complexity of Nash equilibria in anonymous games
• Query complexity of approximate Nash equilibria
• Playing anonymous games using simple strategies
• scientific article; zbMATH DE number 6866347 (Why is no real title available?)
• Query complexity of approximate nash equilibria
• An Efficient PTAS for Two-Strategy Anonymous Games
• Learning equilibria of games via payoff queries

This page was built for publication: Query complexity of approximate equilibria in anonymous games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460801)