English
Related papers

Related papers: Simple Uncoupled No-Regret Learning Dynamics for E…

200 papers

The existence of simple, uncoupled no-regret 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 that when…

Computer Science and Game Theory · Computer Science 2022-09-05 Andrea Celli , Alberto Marchesi , Gabriele Farina , 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

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

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

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

Unlike normal-form games, where correlated equilibria have been studied for more than 45 years, extensive-form correlation is still generally not well understood. Part of the reason for this gap is that the sequential nature of…

Computer Science and Game Theory · Computer Science 2020-09-10 Gabriele Farina , 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

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

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

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

We investigate two notions of correlated equilibrium for extensive-form games: extensive-form correlated equilibrium (EFCE) and behavioral correlated equilibrium (BCE). We show that the two are outcome-equivalent, in the sense that every…

Computer Science and Game Theory · Computer Science 2024-02-09 Brian Hu Zhang , Tuomas Sandholm

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

We study equilibrium computation with extensive-form correlation in two-player turn-taking stochastic games. Our main results are two-fold: (1) We give an algorithm for computing a Stackelberg extensive-form correlated equilibrium (SEFCE),…

Computer Science and Game Theory · Computer Science 2024-12-24 Hanrui Zhang , Yu Cheng , Vincent Conitzer

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

We study the problem of finding optimal correlated equilibria of various sorts in extensive-form games: normal-form coarse correlated equilibrium (NFCCE), extensive-form coarse correlated equilibrium (EFCCE), and extensive-form correlated…

Computer Science and Game Theory · Computer Science 2025-01-28 Brian Zhang , Gabriele Farina , Andrea Celli , Tuomas Sandholm

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

We initiate the study of trembling-hand perfection in sequential (i.e., extensive-form) games with correlation. We introduce the extensive-form perfect correlated equilibrium (EFPCE) as a refinement of the classical extensive-form…

Computer Science and Game Theory · Computer Science 2020-12-14 Alberto Marchesi , Nicola Gatti

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

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

A recent paper by Farina & Pipis (2023) established the existence of uncoupled no-linear-swap regret dynamics with polynomial-time iterations in extensive-form games. The equilibrium points reached by these dynamics, known as linear…

Computer Science and Game Theory · Computer Science 2024-03-19 Brian Hu Zhang , Gabriele Farina , Tuomas Sandholm
‹ Prev 1 2 3 10 Next ›