An Efficient PTAS for Two-Strategy Anonymous Games

DOI10.1007/978-3-540-92185-1_26zbMath1304.91013OpenAlexW1855561663MaRDI QIDQ5504541

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

Mathematics Subject Classification ID

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

Related Items (6)

Query Complexity of Approximate Equilibria in Anonymous Games ⋮ Query complexity of approximate equilibria in anonymous games ⋮ Nash equilibria: complexity, symmetries, and approximation ⋮ Sparse covers for sums of indicators ⋮ Approximate Nash equilibria in anonymous games ⋮ Learning Poisson binomial distributions

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