activity
20152026
most citedNear-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games

17 citations · 187 across the 55 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

cs.GT2019★ 5 cited

Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium

Gabriele Farina, Chun Kai Ling, Fei Fang +1

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

cs.GT2019★ 14 cited

Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions

Gabriele Farina, Christian Kroer, Tuomas Sandholm

We study the performance of optimistic regret-minimization algorithms for both minimizing regret in, and computing Nash equilibria of, zero-sum extensive-form games. In order to ap…

cs.GT2019

Coarse Correlation in Extensive-Form Games

Gabriele Farina, Tommaso Bianchi, 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…

cs.GT2019★ 10 cited

Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks

Gabriele Farina, Chun Kai Ling, Fei Fang +1

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…

cs.GT2019★ 9 cited

Stable-Predictive Optimistic Counterfactual Regret Minimization

Gabriele Farina, Christian Kroer, Noam Brown +1

The CFR framework has been a powerful tool for solving large-scale extensive-form games in practice. However, the theoretical rate at which past CFR-based algorithms converge to th…