English
Related papers

Related papers: No-Regret Learning Dynamics for Extensive-Form Cor…

200 papers

The existence of simple uncoupled no-regret learning dynamics that converge to correlated equilibria in normal-form games is a celebrated result in the theory of multi-agent systems. Specifically, it has been known for more than 20 years…

Computer Science and Game Theory · Computer Science 2021-05-28 Gabriele Farina , Andrea Celli , Alberto Marchesi , Nicola Gatti

A recent emerging trend in the literature on learning in games has been concerned with providing faster learning dynamics for correlated and coarse correlated equilibria in normal-form games. Much less is known about the significantly more…

Computer Science and Game Theory · Computer Science 2022-02-14 Ioannis Anagnostides , Gabriele Farina , Christian Kroer , Andrea Celli , Tuomas Sandholm

Coarse correlation models strategic interactions of rational agents complemented by a correlation device, that is a mediator that can recommend behavior but not enforce it. Despite being a classical concept in the theory of normal-form…

Computer Science and Game Theory · Computer Science 2019-08-28 Gabriele Farina , Tommaso Bianchi , Tuomas Sandholm

No-regret learning dynamics play a central role in game theory, enabling decentralized convergence to equilibrium for concepts such as Coarse Correlated Equilibrium (CCE) or Correlated Equilibrium (CE). In this work, we improve the…

Computer Science and Game Theory · Computer Science 2025-11-05 Asrin Efe Yorulmaz , Tamer Başar

While in two-player zero-sum games the Nash equilibrium is a well-established prescriptive notion of optimal play, its applicability as a prescriptive tool beyond that setting is limited. Consequently, the study of decentralized learning…

Computer Science and Game Theory · Computer Science 2021-09-17 Gabriele Farina , Andrea Celli , Tuomas Sandholm

In this paper, we establish efficient and uncoupled learning dynamics so that, when employed by all players in multiplayer perfect-recall imperfect-information extensive-form games, the trigger regret of each player grows as $O(\log T)$…

Computer Science and Game Theory · Computer Science 2023-09-20 Ioannis Anagnostides , Gabriele Farina , Tuomas Sandholm

Hindsight rationality is an approach to playing general-sum games that prescribes no-regret learning dynamics for individual agents with respect to a set of deviations, and further describes jointly rational behavior among multiple agents…

Computer Science and Game Theory · Computer Science 2022-06-03 Dustin Morrill , Ryan D'Orazio , Marc Lanctot , James R. Wright , Michael Bowling , Amy R. Greenwald

Imperfect-Information Extensive-Form Games (IIEFGs) is a prevalent model for real-world games involving imperfect information and sequential plays. The Extensive-Form Correlated Equilibrium (EFCE) has been proposed as a natural solution…

Machine Learning · Computer Science 2022-05-17 Ziang Song , Song Mei , Yu Bai

While Nash equilibrium in extensive-form games is well understood, very little is known about the properties of extensive-form correlated equilibrium (EFCE), both from a behavioral and from a computational point of view. In this setting,…

Computer Science and Game Theory · Computer Science 2019-10-29 Gabriele Farina , Chun Kai Ling , Fei Fang , Tuomas Sandholm

Characterizing the performance of no-regret dynamics in multi-player games is a foundational problem at the interface of online learning and game theory. Recent results have revealed that when all players adopt specific learning algorithms,…

Computer Science and Game Theory · Computer Science 2023-11-28 Ioannis Anagnostides , Alkis Kalavasis , Tuomas Sandholm , Manolis Zampetakis

Hindsight rationality is an approach to playing general-sum games that prescribes no-regret learning dynamics for individual agents with respect to a set of deviations, and further describes jointly rational behavior among multiple agents…

Computer Science and Game Theory · Computer Science 2022-06-24 Dustin Morrill , Ryan D'Orazio , Marc Lanctot , James R. Wright , Michael Bowling , Amy Greenwald

Self-play methods based on regret minimization have become the state of the art for computing Nash equilibria in large two-players zero-sum extensive-form games. These methods fundamentally rely on the hierarchical structure of the players'…

Computer Science and Game Theory · Computer Science 2019-10-29 Gabriele Farina , Chun Kai Ling , Fei Fang , Tuomas Sandholm

No-regret learners seek to minimize the difference between the loss they cumulated through the actions they played, and the loss they would have cumulated in hindsight had they consistently modified their behavior according to some strategy…

Computer Science and Game Theory · Computer Science 2023-11-09 Gabriele Farina , Charilaos Pipis

As quantum processors advance, the emergence of large-scale decentralized systems involving interacting quantum-enabled agents is on the horizon. Recent research efforts have explored quantum versions of Nash and correlated equilibria as…

Computer Science and Game Theory · Computer Science 2024-12-18 Wayne Lin , Georgios Piliouras , Ryann Sim , Antonios Varvitsiotis

The Nash Equilibrium (NE) assumes rational play in imperfect-information Extensive-Form Games (EFGs) but fails to ensure optimal strategies for off-equilibrium branches of the game tree, potentially leading to suboptimal outcomes in…

Computer Science and Game Theory · Computer Science 2025-08-12 Hang Ren , Xiaozhen Sun , Tianzi Ma , Jiajia Zhang , Xuan Wang

Correlated Equilibrium is a solution concept that is more general than Nash Equilibrium (NE) and can lead to outcomes with better social welfare. However, its natural extension to the sequential setting, the \textit{Extensive Form…

Computer Science and Game Theory · Computer Science 2023-01-02 Chun Kai Ling , Fei Fang

The long-run behavior of multi-agent learning - and, in particular, no-regret learning - is relatively well-understood in potential games, where players have aligned interests. By contrast, in harmonic games - the strategic counterpart of…

Computer Science and Game Theory · Computer Science 2024-12-31 Davide Legacci , Panayotis Mertikopoulos , Christos H. Papadimitriou , Georgios Piliouras , Bary S. R. Pradelski

In this paper, we examine the long-run behavior of regularized, no-regret learning in finite games. A well-known result in the field states that the empirical frequencies of no-regret play converge to the game's set of coarse correlated…

Computer Science and Game Theory · Computer Science 2023-11-07 Victor Boone , Panayotis Mertikopoulos

A recent line of work has established uncoupled learning dynamics such that, when employed by all players in a game, each player's \emph{regret} after $T$ repetitions grows polylogarithmically in $T$, an exponential improvement over the…

Computer Science and Game Theory · Computer Science 2022-10-18 Gabriele Farina , Ioannis Anagnostides , Haipeng Luo , Chung-Wei Lee , Christian Kroer , Tuomas Sandholm

Simple adaptive procedures that converge to correlated equilibria are known to exist for normal form games (Hart and Mas-Colell 2000), but no such analogue exists for extensive-form games. Leveraging inspiration from Zinkevich et al.…

Computer Science and Game Theory · Computer Science 2022-07-15 Hugh Zhang
‹ Prev 1 2 3 10 Next ›