Payoff-Based Dynamics for Multiplayer Weakly Acyclic Games

DOI10.1137/070680199zbMath1186.91033MaRDI QIDQ5190258

Gürdal Arslan, Jason R. Marden, H. Peyton Young, Jeff S. Shamma

Publication date: 15 March 2010

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/15245/

zbMATH Keywords

repeated games; congestion games; potential games; pure Nash equilibrium; acyclic games

Mathematics Subject Classification ID

91A10: Noncooperative games

91A20: Multistage and repeated games

91A22: Evolutionary games

Related Items

A behavioral study of ``noise in coordination games, Parameter-free sampled fictitious play for solving deterministic dynamic programming problems, Convergence to equilibrium of logit dynamics for strategic games, On the structure of weakly acyclic games, Revisiting log-linear learning: asynchrony, completeness and payoff-based implementation, Learning efficient Nash equilibria in distributed systems, Sampled fictitious play for approximate dynamic programming, Evolutionary dynamics and equitable core selection in assignment games, Distributed robust adaptive equilibrium computation for generalized convex games, Probe and adjust in information transfer games, Weakly-acyclic (internet) routing games, Selecting efficient correlated equilibria through distributed learning, On convergence rates of game theoretic reinforcement learning algorithms, Learning to play efficient coarse correlated equilibria, State based potential games, Utility distribution strategy of the task agents in coalition skill games, On Best-Response Dynamics in Potential Games