paper-with-me

Papers

From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization

2020-02-19 · 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

In this paper we investigate the Follow the Regularized Leader dynamics in sequential imperfect information games (IIG). We generalize existing results of Poincar\'e recurrence from normal-form games to zero-sum two-player imperfect information games and other sequential game settings. We then investigate how adapting the reward (by adding a regularization term) of the game can give strong convergence guarantees in monotone games. We continue by showing how this reward adaptation technique can be leveraged to build algorithms that converge exactly to the Nash equilibrium. Finally, we show how these insights can be directly used to build state-of-the-art model-free algorithms for zero-sum two-player Imperfect Information Games (IIG).

📄 PDF Abstract BibTeX arXiv:2002.08456

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games

2019-10-28 · NeurIPS 2019 12 · Lampros Flokas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Georgios Piliouras

We study a wide class of non-convex non-concave min-max games that generalizes over standard bilinear zero-sum games. In this class, players control the inputs of a smooth function whose output is being applied to a bili…

A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights

2024-05-12 · Davide Legacci, Panayotis Mertikopoulos, Bary Pradelski

In view of the complexity of the dynamics of learning in games, we seek to decompose a game into simpler components where the dynamics' long-run behavior is well understood. A natural starting point for this is Helmholtz…

Online Learning in Periodic Zero-Sum Games

2021-11-05 · NeurIPS 2021 12 · Tanner Fiez, Ryann Sim, Stratis Skoulakis, Georgios Piliouras 외

A seminal result in game theory is von Neumann's minmax theorem, which states that zero-sum games admit an essentially unique equilibrium solution. Classical learning results build on this theorem to show that online no-…

Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence

2021-06-09 · Yun Kuen Cheung, Georgios Piliouras

We present a novel control-theoretic understanding of online optimization and learning in games, via the notion of passivity. Passivity is a fundamental concept in control theory, which abstracts energy conservation and …

A Policy-Gradient Approach to Solving Imperfect-Information Games with Iterate Convergence

2024-08-01

Policy gradient methods have become a staple of any single-agent reinforcement learning toolbox, due to their combination of desirable properties: iterate convergence, efficient use of stochastic trajectory feedback, and…