Gabriele Farina

Orcid: 0000-0002-3976-0061

According to our database1, Gabriele Farina authored at least 85 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Policy-Gradient Approach to Solving Imperfect-Information Games with Iterate Convergence.
CoRR, 2024

LiteEFG: An Efficient Python Library for Solving Extensive-form Games.
CoRR, 2024

A Lower Bound on Swap Regret in Extensive-Form Games.
CoRR, 2024

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms.
CoRR, 2024

Polynomial-Time Computation of Exact Φ-Equilibria in Polyhedral Games.
CoRR, 2024

Efficient Φ-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games.
CoRR, 2024

Regularized Conventions: Equilibrium Computation as a Model of Pragmatic Reasoning.
Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), 2024

Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Sequential Games.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

The Update-Equivalence Framework for Decision-Time Planning.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

The Consensus Game: Language Model Generation via Equilibrium Search.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Contested Logistics: A Game-Theoretic Approach.
Proceedings of the Decision and Game Theory for Security - 15th International Conference, 2024

Efficient Learning in Polyhedral Games via Best-Response Oracles.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games.
CoRR, 2023

Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Extensive-Form Games.
CoRR, 2023

Hidden-Role Games: Equilibrium Concepts and Computation.
CoRR, 2023

Steering No-Regret Learners to Optimal Equilibria.
CoRR, 2023

Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Team-PSRO for Learning Approximate TMECor in Large Team Games via Cooperative Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Polynomial-Time Linear-Swap Regret Minimization in Imperfect-Information Sequential Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Regret Matching+: (In)Stability and Fast Convergence in Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Convergence of No-Regret Learning Dynamics in Time-Varying Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization.
Proceedings of the International Conference on Machine Learning, 2023

Near-Optimal Φ-Regret Learning in Extensive-Form Games.
Proceedings of the International Conference on Machine Learning, 2023

ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Meta-Learning in Games.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Mastering the Game of No-Press Diplomacy via Human-Regularized Reinforcement Learning and Planning.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
A Multi-Modal Analysis of the Freezing of Gait Phenomenon in Parkinson's Disease.
Sensors, 2022

Simple Uncoupled No-regret Learning Dynamics for Extensive-form Correlated Equilibrium.
J. ACM, 2022

Clairvoyant Regret Minimization: Equivalence with Nemirovski's Conceptual Prox Method and Extension to General Convex Games.
CoRR, 2022

Near-Optimal No-Regret Learning for General Convex Games.
CoRR, 2022

Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games.
CoRR, 2022

Team Belief DAG Form: A Concise Representation for Team-Correlated Game-Theoretic Decision Making.
CoRR, 2022

Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Subgame Solving in Adversarial Team Games.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Near-Optimal No-Regret Learning Dynamics for General Convex Games.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Uncoupled Learning Dynamics with <i>O(log T)</i> Swap Regret in Multiplayer Games.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Modeling Strong and Human-Like Gameplay with KL-Regularized Search.
Proceedings of the International Conference on Machine Learning, 2022

Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games.
Proceedings of the International Conference on Machine Learning, 2022

On Last-Iterate Convergence Beyond Zero-Sum Games.
Proceedings of the International Conference on Machine Learning, 2022

Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Combination treatment optimization using a pan-cancer pathway model.
PLoS Comput. Biol., 2021

Modeling Strong and Human-Like Gameplay with KL-Regularized Search.
CoRR, 2021

Efficient Decentralized Learning Dynamics for Extensive-Form Coarse Correlated Equilibrium: No Expensive Computation of Stationary Distributions Required.
CoRR, 2021

Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Decentralized No-regret Learning Algorithms for Extensive-form Correlated Equilibria (Extended Abstract).
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results.
Proceedings of the 38th International Conference on Machine Learning, 2021

Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games.
CoRR, 2020

No-regret learning dynamics for extensive-form correlated and coarse correlated equilibria.
CoRR, 2020

Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Stochastic Regret Minimization in Extensive-Form Games.
Proceedings of the 37th International Conference on Machine Learning, 2020

Coarse Correlation in Extensive-Form Games.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Regret Circuits: Composability of Regret Minimizers.
Proceedings of the 36th International Conference on Machine Learning, 2019

Stable-Predictive Optimistic Counterfactual Regret Minimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

A Theoretical and Algorithmic Analysis of Configurable MDPs.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Quasi-Perfect Stackelberg Equilibrium.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Composability of Regret Minimizers.
CoRR, 2018

Solving Large Sequential Games with the Excessive Gap Technique.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Ex ante coordination and collusion in zero-sum multi-player extensive-form games.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Practical exact algorithm for trembling-hand equilibrium refinements in games.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Trembling-Hand Perfection in Extensive-Form Games with Commitment.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Adopting the Cascade Model in Ad Auctions: Efficiency Bounds and Truthful Algorithmic Mechanisms.
J. Artif. Intell. Res., 2017

Smoothing Method for Approximate Extensive-Form Perfect Equilibrium.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Operation Frames and Clubs in Kidney Exchange.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Regret Minimization in Behaviorally-Constrained Zero-Sum Games.
Proceedings of the 34th International Conference on Machine Learning, 2017

Inter-Club Kidney Exchange.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

Extensive-Form Perfect Equilibrium Computation in Two-Player Games.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Ad Auctions and Cascade Model: GSP Inefficiency and Algorithms.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Dynamic subtrees queries revised: the Depth First Tour Tree.
CoRR, 2015

A linear time algorithm to compute the impact of all the articulation points.
CoRR, 2015

Dynamic Subtrees Queries Revisited: The Depth First Tour Tree.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015


  Loading...