Computing Equilibria in Large Games We Play

DOI10.1007/978-3-540-69407-6_18MaRDI QIDQ3507429zbMATH OpenOpenAlexFDO

Authors Constantinos Daskalakis

Publication date 19 June 2008

Published in Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69407-6_18

Mathematics Subject Classification ID

Games with infinitely many players (91A07) Noncooperative games (91A10) Special types of economic equilibria (91B52)

Recommendations

• Approximate Nash equilibria in anonymous games
• Computing equilibria in multi-player games
• On the complexity of Nash equilibria in anonymous games
• Query complexity of approximate equilibria in anonymous games
• Playing anonymous games using simple strategies

Cited in

(9)

• Approximate Nash equilibria in anonymous games
• Best-reply dynamics in large binary-choice anonymous games
• Computing equilibria in multi-player games
• Multilinear games
• Privacy and truthful equilibrium selection for aggregative games
• On sparse discretization for graphical games
• Computing Equilibria of Dynamic Games
• Computing Supergame Equilibria
• Action-graph games

This page was built for publication: Computing Equilibria in Large Games We Play

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