On the approximation performance of fictitious play in finite games
From MaRDI portal
DOI10.1007/s00182-012-0362-6zbMath1300.91004arXiv1103.1040OpenAlexW3017295748MaRDI QIDQ378343
Rahul Savani, Troels Bjerre Sørensen, Paul W. Goldberg, Carmine Ventre
Publication date: 11 November 2013
Published in: International Journal of Game Theory, Algorithms – ESA 2011 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.1040
Related Items (3)
On the rate of convergence of fictitious play ⋮ Learning convex partitions and computing game-theoretic equilibria from best response queries ⋮ On the communication complexity of approximate Nash equilibria
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate well-supported Nash equilibria below two-thirds
- Consistency and cautious fictitious play
- Stochastic uncoupled dynamics and Nash equilibrium
- Well supported approximate equilibria in bimatrix games
- A note on approximate Nash equilibria
- New algorithms for approximate Nash equilibria in bimatrix games
- Learning mixed equilibria
- Fictitious play in \(2\times n\) games
- Potential games
- An iterative method of solving a game
- On the Rate of Convergence of Fictitious Play
- On Learning Algorithms for Nash Equilibria
- Settling the complexity of computing two-player Nash equilibria
- An Optimization Approach for Approximate Nash Equilibria
- The Complexity of Computing a Nash Equilibrium
- A Fictitious Play Approach to Large-Scale Optimization
This page was built for publication: On the approximation performance of fictitious play in finite games
