中文
相关论文

相关论文: On the Outcome Equivalence of Extensive-Form and B…

200 篇论文

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…

计算机科学与博弈论 · 计算机科学 2020-09-10 Gabriele Farina , Tuomas Sandholm

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),…

计算机科学与博弈论 · 计算机科学 2024-12-24 Hanrui Zhang , Yu Cheng , Vincent Conitzer

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…

计算机科学与博弈论 · 计算机科学 2025-01-28 Brian Zhang , Gabriele Farina , 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…

计算机科学与博弈论 · 计算机科学 2019-08-28 Gabriele Farina , Tommaso Bianchi , Tuomas Sandholm

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,…

计算机科学与博弈论 · 计算机科学 2019-10-29 Gabriele Farina , Chun Kai Ling , Fei Fang , Tuomas Sandholm

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…

计算机科学与博弈论 · 计算机科学 2021-05-28 Gabriele Farina , Andrea Celli , Alberto Marchesi , Nicola Gatti

We investigate the computation of equilibria in extensive-form games where ex ante correlation is possible, focusing on correlated equilibria requiring the least amount of communication between the players and the mediator. Motivated by the…

计算机科学与博弈论 · 计算机科学 2019-01-21 Andrea Celli , Stefano Coniglio , Nicola Gatti

We study the scenario where the players of a classical complete information game initially share an entangled pure quantum state. Each player may perform arbitrary local operations on his own qubits, but no direct communication is allowed.…

量子物理 · 物理学 2015-03-17 Alan Deckelbaum

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…

机器学习 · 计算机科学 2022-05-17 Ziang Song , Song Mei , Yu Bai

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…

计算机科学与博弈论 · 计算机科学 2023-01-02 Chun Kai Ling , Fei Fang

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…

计算机科学与博弈论 · 计算机科学 2022-09-05 Andrea Celli , Alberto Marchesi , Gabriele Farina , Nicola Gatti

A natural goal in multiagent learning besides finding equilibria is to learn rationalizable behavior, where players learn to avoid iteratively dominated actions. However, even in the basic setting of multiplayer general-sum games, existing…

机器学习 · 计算机科学 2022-10-21 Yuanhao Wang , Dingwen Kong , Yu Bai , Chi Jin

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…

计算机科学与博弈论 · 计算机科学 2020-12-14 Alberto Marchesi , Nicola Gatti

A major open question in algorithmic game theory is whether normal-form correlated equilibria (NFCE) can be computed efficiently in succinct games such as extensive-form games [DFF+25,6PR24,FP23,HvS08,VSF08,PR08]. Motivated by this…

计算机科学与博弈论 · 计算机科学 2025-07-16 Vincent Cheval , Florian Horn , Soumyajit Paul , Mahsa Shirmohammadi

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…

计算机科学与博弈论 · 计算机科学 2022-02-14 Ioannis Anagnostides , Gabriele Farina , Christian Kroer , Andrea Celli , Tuomas Sandholm

Correlated Equilibrium (CE) is a well-established solution concept that captures coordination among agents and enjoys good algorithmic properties. In real-world multi-agent systems, in addition to being in an equilibrium, agents' policies…

人工智能 · 计算机科学 2023-02-17 Libo Zhang , Yang Chen , Toru Takisaka , Bakh Khoussainov , Michael Witbrock , Jiamou Liu

We extend anytime constraints to the Markov game setting and the corresponding solution concept of an anytime-constrained equilibrium (ACE). Then, we present a comprehensive theory of anytime-constrained equilibria that includes (1) a…

机器学习 · 计算机科学 2025-03-05 Jeremy McMahan

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…

计算机科学与博弈论 · 计算机科学 2021-09-17 Gabriele Farina , Andrea Celli , Tuomas Sandholm

We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytically tractable than the standard definition in terms of…

计算机科学与博弈论 · 计算机科学 2011-06-06 Noah D. Stein , Pablo A. Parrilo , Asuman Ozdaglar

For common notions of correlated equilibrium in extensive-form games, computing an optimal (e.g., welfare-maximizing) equilibrium is NP-hard. Other equilibrium notions -- communication (Forges 1986) and certification (Forges & Koessler…

计算机科学与博弈论 · 计算机科学 2022-12-02 Brian Hu Zhang , Tuomas Sandholm
‹ 上一页 1 2 3 10 下一页 ›