Learning to play efficient coarse correlated equilibria
From MaRDI portal
Publication:1741209
DOI10.1007/s13235-018-0244-zzbMath1411.91117arXiv1512.02160OpenAlexW2791232707WikidataQ130183742 ScholiaQ130183742MaRDI QIDQ1741209
Holly P. Borowski, Jeff S. Shamma, Jason R. Marden
Publication date: 3 May 2019
Published in: Dynamic Games and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.02160
Cites Work
- Unnamed Item
- Unnamed Item
- Revisiting log-linear learning: asynchrony, completeness and payoff-based implementation
- Learning efficient Nash equilibria in distributed systems
- Average testing and Pareto efficiency
- Stochastic evolutionary game dynamics
- Learning by trial and error
- The statistical mechanics of strategic interaction
- Calibrated learning and correlated equilibrium
- Selecting efficient correlated equilibria through distributed learning
- Value of information in two-team zero-sum problems
- The logit-response dynamics
- Polynomial-time computation of exact correlated equilibrium in compact games
- Global Nash convergence of Foster and Young's regret testing
- Network Games: Theory, Models, and Dynamics
- Network Security
- Correlated Equilibrium as an Expression of Bayesian Rationality
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- Game Theory in Wireless and Communication Networks
- Achieving Pareto Optimality Through Distributed Learning
- Payoff-Based Dynamics for Multiplayer Weakly Acyclic Games
- The Evolution of Conventions
- Nash Equilibrium Seeking in Noncooperative Games
- Adaptive Heuristics
- Computing correlated equilibria in multi-player games
- Computing correlated equilibria in multi-player games
