On Learning Algorithms for Nash Equilibria
From MaRDI portal
Publication:3162512
DOI10.1007/978-3-642-16170-4_11zbMath1310.91033MaRDI QIDQ3162512
Christos H. Papadimitriou, Constantinos Daskalakis, Gregory Valiant, Rafael Frongillo, George Pierrakos
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
91A10: Noncooperative games
91A26: Rationality and learning in game theory
91A22: Evolutionary games
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
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