Approximate Nash equilibria in anonymous games

DOI10.1016/j.jet.2014.02.002zbMath1330.91015OpenAlexW2083207585MaRDI QIDQ2253838

Constantinos Daskalakis, Christos H. Papadimitriou

Publication date: 13 February 2015

Published in: Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jet.2014.02.002

zbMATH Keywords

Nash equilibriumapproximation algorithmsanonymous games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10)

Related Items (23)

A Maximum Principle Approach to a Deterministic Mean Field Game of Control with Absorption ⋮ Auction Design with a Revenue Target ⋮ Settling Some Open Problems on 2-Player Symmetric Nash Equilibria ⋮ Query Complexity of Approximate Equilibria in Anonymous Games ⋮ ReGale: some memorable results ⋮ Query complexity of approximate equilibria in anonymous games ⋮ Lower bounds for the query complexity of equilibria in Lipschitz games ⋮ PPAD-complete approximate pure Nash equilibria in Lipschitz games ⋮ Public goods games in directed networks ⋮ Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost ⋮ PPAD-complete pure approximate Nash equilibria in Lipschitz games ⋮ Nash equilibria: complexity, symmetries, and approximation ⋮ Sparse covers for sums of indicators ⋮ Computing approximate Nash equilibria in polymatrix games ⋮ Introduction to computer science and economic theory ⋮ Approximate Nash equilibria in anonymous games ⋮ Lipschitz continuity and approximate equilibria ⋮ Lower bounds for the query complexity of equilibria in Lipschitz games ⋮ Lipschitz Continuity and Approximate Equilibria ⋮ Vector equilibrium problems under improvement sets and linear scalarization with stability applications ⋮ Unnamed Item ⋮ Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost ⋮ A Mean Field Game of Optimal Portfolio Liquidation

Cites Work

• Sparse covers for sums of indicators
• Convergence to approximate Nash equilibria in congestion games
• Anonymous games with binary actions
• Congestion games with player-specific payoff functions
• Approximate Nash equilibria in anonymous games
• The women of Cairo: equilibria in large anonymous games
• A class of games possessing pure-strategy Nash equilibria
• Non-cooperative games
• The complexity of computing a Nash equilibrium
• On the impact of combinatorial structure on congestion games
• The complexity of pure Nash equilibria
• On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
• Lipschitz Games
• On oblivious PTAS's for nash equilibrium
• The Complexity of Computing a Nash Equilibrium
• Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
• Max flows in O(nm) time, or better
• An Efficient PTAS for Two-Strategy Anonymous Games
• Quasi-Equilibria in Markets with Non-Convex Preferences
• Existence of an Equilibrium for a Competitive Economy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate Nash equilibria in anonymous games