Learning efficient Nash equilibria in distributed systems
From MaRDI portal
Publication:423765
DOI10.1016/j.geb.2012.02.017zbMath1239.91018MaRDI QIDQ423765
Bary S. R. Pradelski, H. Peyton Young
Publication date: 4 June 2012
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:c492c12a-0b1a-4290-9750-65376b6c2ab6
91A26: Rationality and learning in game theory
Related Items
Cites Work
- Unnamed Item
- Revisiting log-linear learning: asynchrony, completeness and payoff-based implementation
- Uncoupled automata and pure Nash equilibria
- Average testing and Pareto efficiency
- Stochastic uncoupled dynamics and Nash equilibrium
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
- Learning by trial and error
- Multi-agent learning for engineers
- Evolving aspirations and cooperation
- The statistical mechanics of strategic interaction
- How noise matters.
- Learning, hypothesis testing, and Nash equilibrium.
- Regret-based continuous-time dynamics.
- Multiagent learning using a variable learning rate
- The statistical mechanics of best-response strategy revision
- Global Nash convergence of Foster and Young's regret testing
- Evolutionary Implementation and Congestion Pricing
- Joint Strategy Fictitious Play With Inertia for Potential Games
- Achieving Pareto Optimality Through Distributed Learning
- Algorithms, games, and the internet
- Payoff-Based Dynamics for Multiplayer Weakly Acyclic Games
- Distributed Random Access Algorithm: Scheduling and Congestion Control
- Learning, Mutation, and Long Run Equilibria in Games
- The Evolution of Conventions
