Gabriele Farina

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 2026Show all

3 papers · 1 filter

cs.GT2026

Normal-Form Correlation in Markov Games

Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina +3

There has been a surge of recent work on correlated equilibrium concepts in Markov games. However, existing results focus on concepts weaker than normal-form correlated equilibria…

cs.DS2026

Polynomial-time computation of $ℓ_{p}$ -contraction fixed points for even $p$

Constantinos Daskalakis, Gabriele Farina, Brian Hu Zhang

We give a $poly (d, p, lo g (1/ ε))$ -time algorithm that computes an $ε$ -approximate fixed point of any $ℓ_{p}$ -nonexpansive map $f : X \to X$ , where $\mat…

cs.GT2026

Efficient representations for team and imperfect-recall equilibrium computation

Luca Carminati, Brian Hu Zhang, Federico Cacciamani +4

Equilibrium finding in two-player zero-sum games with perfect recall is a well-studied topic that has led to many breakthroughs in computational game theory. This paper aims to gen…

Normal-Form Correlation in Markov Games

Polynomial-time computation of ℓp​-contraction fixed points for even p

Efficient representations for team and imperfect-recall equilibrium computation

Polynomial-time computation of $ℓ_{p}$ -contraction fixed points for even $p$