On Learning Algorithms for Nash Equilibria

DOI10.1007/978-3-642-16170-4_11zbMath1310.91033OpenAlexW3135939364MaRDI QIDQ3162512

Rafael Frongillo, Gregory Valiant, George Pierrakos, Constantinos Daskalakis, Christos H. Papadimitriou

Publication date: 19 October 2010

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16170-4_11

Mathematics Subject Classification ID

Noncooperative games (91A10) Rationality and learning in game theory (91A26) Evolutionary games (91A22)

Related Items

On the approximation performance of fictitious play in finite games, On the communication complexity of approximate Nash equilibria, A Competitive Rate Allocation Game, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mixed equilibria and dynamical systems arising from fictitious play in perturbed games
• Adaptive game playing using multiplicative weights
• An iterative method of solving a game
• A Simple Adaptive Procedure Leading to Correlated Equilibrium
• The Nonstochastic Multiarmed Bandit Problem
• Intrinsic robustness of the price of anarchy
• Multiplicative updates outperform generic no-regret learning in congestion games