← All authors Gabriele Farina Massachusetts Institute of Technology (per OpenAlex) · ORCID · OpenAlex
21 papers in scope · 20 published · 1 on the econ.EM arXiv · 181 citations · h-index 8 (over the papers listed here)
Papers (1 of 21)
working paper 2025 · arXiv
Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria
published 2025 · Operations Research · 2 citations · first circulated 2021
Efficient Learning in Polyhedral Games via Best-Response Oracles
published 2024 · Proceedings of the AAAI Conference on Artificial Intelligence · 1 citations · first circulated 2023
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property
published 2024 · Proceedings of the AAAI Conference on Artificial Intelligence · 4 citations · first circulated 2023
with Ioannis Anagnostides, Ioannis Panageas, Tüomas Sandholm
Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria
published 2022 · Proceedings of the 23rd ACM Conference on Economics and Computation · 4 citations · first circulated 2020
Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation
published 2022 · Proceedings of the 23rd ACM Conference on Economics and Computation · 2 citations
with Brian Zhang, Andrea Celli, Tüomas Sandholm
Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games
published 2022 · Proceedings of the AAAI Conference on Artificial Intelligence · 1 citations · first circulated 2021
with Tüomas Sandholm
Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium
published 2021 · Neural Information Processing Systems
with Tüomas Sandholm
no link
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent
published 2021 · Proceedings of the AAAI Conference on Artificial Intelligence · 23 citations · first circulated 2020
Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games
published 2021 · Proceedings of the AAAI Conference on Artificial Intelligence · 8 citations
with Tüomas Sandholm
Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games
published 2021 · Proceedings of the AAAI Conference on Artificial Intelligence · 7 citations
with Robin Schmucker, Tüomas Sandholm
Coarse Correlation in Extensive-Form Games
published 2020 · Proceedings of the AAAI Conference on Artificial Intelligence · 13 citations
with Tommaso Bianchi, Tüomas Sandholm
Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games
published 2019 · Proceedings of the AAAI Conference on Artificial Intelligence · 34 citations · first circulated 2018
Quasi-Perfect Stackelberg Equilibrium
published 2019 · Proceedings of the AAAI Conference on Artificial Intelligence · 5 citations
Regret Circuits: Composability of Regret Minimizers
published 2019 · International Conference on Machine Learning · 11 citations · first circulated 2018
Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead
published 2018 · Proceedings of the AAAI Conference on Artificial Intelligence · 24 citations · first circulated 2017
Practical exact algorithm for trembling-hand equilibrium refinements in games
published 2018 · Neural Information Processing Systems · 8 citations
with Nicola Gatti, Tüomas Sandholm
no link
Regret minimization in behaviorally-constrained zero-sum games
published 2017 · International Conference on Machine Learning · 12 citations
Extensive-Form Perfect Equilibrium Computation in Two-Player Games
published 2017 · Proceedings of the AAAI Conference on Artificial Intelligence · 14 citations · first circulated 2016
with Nicola Gatti
Ad Auctions and Cascade Model: GSP Inefficiency and Algorithms
published 2016 · Proceedings of the AAAI Conference on Artificial Intelligence · 6 citations
with Nicola Gatti
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication
published 2016 · Proceedings of the AAAI Conference on Artificial Intelligence · 2 citations · first circulated 2015
with Massimo Cairo, Roméo Rizzi
Assembled from arXiv and OpenAlex. Duplicate records for the same paper are merged, and the published version is shown where we could identify one. Corrections welcome.
Built from arXiv and OpenAlex. Supported by UKRI grant APP47921 (Martin Weidner, UCL · Francis J. DiTraglia, Oxford).