Timezone: »
Potential games are arguably one of the most important and widely studied classes of normal form games. They define the archetypal setting of multi-agent coordination as all agent utilities are perfectly aligned with each other via a common potential function. Can this intuitive framework be transplanted in the setting of Markov Games? What are the similarities and differences between multi-agent coordination with and without state dependence? We present a novel definition of Markov Potential Games (MPG) that generalizes prior attempts at capturing complex stateful multi-agent coordination. Counter-intuitively, insights from normal-form potential games do not carry over as MPGs can consist of settings where state-games can be zero-sum games. In the opposite direction, Markov games where every state-game is a potential game are not necessarily MPGs. Nevertheless, MPGs showcase standard desirable properties such as the existence of deterministic Nash policies. In our main technical result, we prove fast convergence of independent policy gradient to Nash policies by adapting recent gradient dominance property arguments developed for single agent MDPs to multi-agent learning settings.
Author Information
Stefanos Leonardos (Singapore University of Technology and Design)
Will Overman (University of California, Irvine)
Ioannis Panageas (Singapore University of Technology and Design)
I am an Assistant Professor in UC Irvine. Before that I was a MIT Postdoctoral Fellow working with Costis Daskalakis. I obtained my PhD in Algorithms, Combinatorics, and Optimization (ACO) at Georgia Tech, advised by Prasad Tetali. At Georgia Tech, I also obtained a MSc in Mathematics. I did my undergrad studies in National Technical University of Athens. I am interested in theory of computation and its interface with optimization, dynamical systems, probability and statistics, machine learning and their applications to game theory and multi-agent reinforcement learning.
Georgios Piliouras (Singapore University of Technology and Design)
More from the Same Authors
-
2022 Poster: On Last-Iterate Convergence Beyond Zero-Sum Games »
Ioannis Anagnostides · Ioannis Panageas · Gabriele Farina · Tuomas Sandholm -
2022 Spotlight: On Last-Iterate Convergence Beyond Zero-Sum Games »
Ioannis Anagnostides · Ioannis Panageas · Gabriele Farina · Tuomas Sandholm -
2022 Poster: AdaGrad Avoids Saddle Points »
Kimon Antonakopoulos · Panayotis Mertikopoulos · Georgios Piliouras · Xiao Wang -
2022 Spotlight: AdaGrad Avoids Saddle Points »
Kimon Antonakopoulos · Panayotis Mertikopoulos · Georgios Piliouras · Xiao Wang -
2021 Poster: Efficient Online Learning for Dynamic k-Clustering »
Dimitris Fotakis · Georgios Piliouras · Stratis Skoulakis -
2021 Spotlight: Efficient Online Learning for Dynamic k-Clustering »
Dimitris Fotakis · Georgios Piliouras · Stratis Skoulakis -
2021 Poster: Follow-the-Regularized-Leader Routes to Chaos in Routing Games »
Jakub Bielawski · Thiparat Chotibut · Fryderyk Falniowski · Grzegorz Kosiorowski · Michał Misiurewicz · Georgios Piliouras -
2021 Poster: Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence »
Yun Kuen Cheung · Georgios Piliouras -
2021 Spotlight: Follow-the-Regularized-Leader Routes to Chaos in Routing Games »
Jakub Bielawski · Thiparat Chotibut · Fryderyk Falniowski · Grzegorz Kosiorowski · Michał Misiurewicz · Georgios Piliouras -
2021 Spotlight: Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence »
Yun Kuen Cheung · Georgios Piliouras -
2021 Poster: From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization »
Julien Perolat · Remi Munos · Jean-Baptiste Lespiau · Shayegan Omidshafiei · Mark Rowland · Pedro Ortega · Neil Burch · Thomas Anthony · David Balduzzi · Bart De Vylder · Georgios Piliouras · Marc Lanctot · Karl Tuyls -
2021 Spotlight: From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization »
Julien Perolat · Remi Munos · Jean-Baptiste Lespiau · Shayegan Omidshafiei · Mark Rowland · Pedro Ortega · Neil Burch · Thomas Anthony · David Balduzzi · Bart De Vylder · Georgios Piliouras · Marc Lanctot · Karl Tuyls -
2020 Poster: Better depth-width trade-offs for neural networks through the lens of dynamical systems »
Evangelos Chatziafratis · Sai Ganesh Nagarajan · Ioannis Panageas -
2020 Poster: From Chaos to Order: Symmetry and Conservation Laws in Game Dynamics »
Sai Ganesh Nagarajan · David Balduzzi · Georgios Piliouras -
2019 Poster: Multiplicative Weights Updates as a distributed constrained optimization algorithm: Convergence to second-order stationary points almost always »
Ioannis Panageas · Georgios Piliouras · xiao wang -
2019 Oral: Multiplicative Weights Updates as a distributed constrained optimization algorithm: Convergence to second-order stationary points almost always »
Ioannis Panageas · Georgios Piliouras · xiao wang