Gabriele Farina

Gabriele Farina

Carnegie Mellon University

H-index: 21

North America-United States

About Gabriele Farina

Gabriele Farina, With an exceptional h-index of 21 and a recent h-index of 20 (since 2020), a distinguished researcher at Carnegie Mellon University, specializes in the field of Computational Game Theory, Optimization, Economics and Computation.

His recent articles reflect a diverse array of research interests and contributions to the field:

Polynomial-Time Computation of Exact -Equilibria in Polyhedral Games

Computing optimal equilibria and mechanisms via learning in zero-sum extensive-form games

On the convergence of no-regret learning dynamics in time-varying games

Efficient -Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games

Team-PSRO for Learning Approximate TMECor in Large Team Games via Cooperative Reinforcement Learning

Regret matching+:(in) stability and fast convergence in games

Optimistic policy gradient in multi-player markov games with a single controller: Convergence beyond the minty property

Efficient Learning in Polyhedral Games via Best-Response Oracles

Gabriele Farina Information

University

Position

PhD Student at

Citations(all)

1172

Citations(since 2020)

1111

Cited By

302

hIndex(all)

21

hIndex(since 2020)

20

i10Index(all)

40

i10Index(since 2020)

39

Email

University Profile Page

Carnegie Mellon University

Google Scholar

View Google Scholar Profile

Gabriele Farina Skills & Research Interests

Computational Game Theory

Optimization

Economics and Computation

Top articles of Gabriele Farina

Title

Journal

Author(s)

Publication Date

Polynomial-Time Computation of Exact -Equilibria in Polyhedral Games

arXiv preprint arXiv:2402.16316

Gabriele Farina

Charilaos Pipis

2024/2/26

Computing optimal equilibria and mechanisms via learning in zero-sum extensive-form games

Advances in Neural Information Processing Systems

Brian Zhang

Gabriele Farina

Ioannis Anagnostides

Federico Cacciamani

Stephen McAleer

...

2024/2/13

On the convergence of no-regret learning dynamics in time-varying games

Advances in Neural Information Processing Systems

Ioannis Anagnostides

Ioannis Panageas

Gabriele Farina

Tuomas Sandholm

2024/2/13

Efficient -Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games

arXiv preprint arXiv:2402.09670

Brian Hu Zhang

Ioannis Anagnostides

Gabriele Farina

Tuomas Sandholm

2024/2/15

Team-PSRO for Learning Approximate TMECor in Large Team Games via Cooperative Reinforcement Learning

Advances in Neural Information Processing Systems

Stephen McAleer

Gabriele Farina

Gaoyue Zhou

Mingzhi Wang

Yaodong Yang

...

2024/2/13

Regret matching+:(in) stability and fast convergence in games

Advances in Neural Information Processing Systems

Gabriele Farina

Julien Grand-Clément

Christian Kroer

Chung-Wei Lee

Haipeng Luo

2024/2/13

Optimistic policy gradient in multi-player markov games with a single controller: Convergence beyond the minty property

Proceedings of the AAAI Conference on Artificial Intelligence

Ioannis Anagnostides

Ioannis Panageas

Gabriele Farina

Tuomas Sandholm

2024/3/24

Efficient Learning in Polyhedral Games via Best-Response Oracles

Proceedings of the AAAI Conference on Artificial Intelligence

Darshan Chakrabarti

Gabriele Farina

Christian Kroer

2024/3/24

Polynomial-time linear-swap regret minimization in imperfect-information sequential games

Advances in Neural Information Processing Systems

Gabriele Farina

Charilaos Pipis

2024/2/13

The Update Equivalence Framework for Decision-Time Planning

arXiv preprint arXiv:2304.13138

Samuel Sokota

Gabriele Farina

David J Wu

Hengyuan Hu

Kevin A Wang

...

2023/4/25

The consensus game: Language model generation via equilibrium search

ICLR

Athul Paul Jacob

Yikang Shen

Gabriele Farina

Jacob Andreas

2024

ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret

International Conference on Learning Representations (ICLR)

Stephen McAleer

Gabriele Farina

Marc Lanctot

Tuomas Sandholm

2022/6/8

Hidden-Role Games: Equilibrium Concepts and Computation

arXiv preprint arXiv:2308.16017

Luca Carminati

Brian Hu Zhang

Gabriele Farina

Nicola Gatti

Tuomas Sandholm

2023/8/30

Team belief DAG: generalizing the sequence form to team games for fast computation of correlated team max-min equilibria via regret minimization

Brian Hu Zhang

Gabriele Farina

Tuomas Sandholm

2023/7/3

Regularized Conventions: Equilibrium Computation as a Model of Pragmatic Reasoning

NAACL

Athul Paul Jacob

Gabriele Farina

Jacob Andreas

2024

Near-Optimal -Regret Learning in Extensive-Form Games

Ioannis Anagnostides

Gabriele Farina

Tuomas Sandholm

2023/7/3

Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games

arXiv preprint arXiv:2311.00676

Yang Cai

Gabriele Farina

Julien Grand-Clément

Christian Kroer

Chung-Wei Lee

...

2023/11/1

Steering no-regret learners to optimal equilibria

arXiv preprint arXiv:2306.05221

Brian Hu Zhang

Gabriele Farina

Ioannis Anagnostides

Federico Cacciamani

Stephen Marcus McAleer

...

2023/6/8

Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Sequential Games

Brian Hu Zhang

Gabriele Farina

Tuomas Sandholm

2023/10/13

On last-iterate convergence beyond zero-sum games

Ioannis Anagnostides

Ioannis Panageas

Gabriele Farina

Tuomas Sandholm

2022/6/28

See List of Professors in Gabriele Farina University(Carnegie Mellon University)

Co-Authors

H-index: 95
Tuomas Sandholm

Tuomas Sandholm

Carnegie Mellon University

H-index: 56
Constantinos Daskalakis

Constantinos Daskalakis

Massachusetts Institute of Technology

H-index: 35
Nicola Gatti

Nicola Gatti

Politecnico di Milano

H-index: 34
Haipeng Luo

Haipeng Luo

University of Southern California

H-index: 31
Fei Fang

Fei Fang

Carnegie Mellon University

H-index: 25
Christian Kroer

Christian Kroer

Columbia University in the City of New York

academic-engine