On the Complexity of Nash Equilibria in Anonymous Games

DOI10.1145/2746539.2746571zbMath1322.91005arXiv1412.5681OpenAlexW2002399727MaRDI QIDQ2941529

Anthi Orfanou, Xi Chen, David Durfee

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.5681

zbMATH Keywords

approximate Nash equilibriaanonymous gamesPPAD-completeness

Mathematics Subject Classification ID

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

Related Items

Privacy and Truthful Equilibrium Selection for Aggregative Games ⋮ Query Complexity of Approximate Equilibria in Anonymous Games ⋮ Query complexity of approximate equilibria in anonymous games ⋮ Public goods games in directed networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich

Uses Software

• Graphs

Cites Work

• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming
• Unnamed Item