An Efficient PTAS for Two-Strategy Anonymous Games

DOI10.1007/978-3-540-92185-1_26zbMATH Open1304.91013OpenAlexW1855561663MaRDI QIDQ5504541FDOQ5504541

Authors: Constantinos Daskalakis 

Publication date: 22 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92185-1_26

Recommendations

• Playing anonymous games using simple strategies
• Approximate Nash equilibria in anonymous games
• On oblivious PTAS's for nash equilibrium
• Query complexity of approximate equilibria in anonymous games
• Query complexity of approximate equilibria in anonymous games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) (n)-person games, (n>2) (91A06)

Cited In (8)

• Playing anonymous games using simple strategies
• Nash equilibria: complexity, symmetries, and approximation
• Query complexity of approximate equilibria in anonymous games
• Query complexity of approximate equilibria in anonymous games
• A size-free CLT for Poisson multinomials and its applications
• Best-reply dynamics in large binary-choice anonymous games
• Sparse covers for sums of indicators
• Approximate Nash equilibria in anonymous games

This page was built for publication: An Efficient PTAS for Two-Strategy Anonymous Games

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