default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriele Farina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c61]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property. AAAI 2024: 9451-9459- [c60]Darshan Chakrabarti, Gabriele Farina, Christian Kroer:
Efficient Learning in Polyhedral Games via Best-Response Oracles. AAAI 2024: 9564-9572 - [c59]Jakub Cerný, Chun Kai Ling, Darshan Chakrabarti, Jingwen Zhang, Gabriele Farina, Christian Kroer, Garud Iyengar:
Contested Logistics: A Game-Theoretic Approach. GameSec 2024: 124-146 - [c58]Athul Paul Jacob, Yikang Shen, Gabriele Farina, Jacob Andreas:
The Consensus Game: Language Model Generation via Equilibrium Search. ICLR 2024 - [c57]Samuel Sokota, Gabriele Farina, David J. Wu, Hengyuan Hu, Kevin A. Wang, J. Zico Kolter, Noam Brown:
The Update-Equivalence Framework for Decision-Time Planning. ICLR 2024 - [c56]Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm:
Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Sequential Games. ICLR 2024 - [c55]Athul Paul Jacob, Gabriele Farina, Jacob Andreas:
Regularized Conventions: Equilibrium Computation as a Model of Pragmatic Reasoning. NAACL-HLT 2024: 2944-2955 - [i64]Brian Hu Zhang, Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm:
Efficient Φ-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games. CoRR abs/2402.09670 (2024) - [i63]Gabriele Farina, Charilaos Pipis:
Polynomial-Time Computation of Exact Φ-Equilibria in Polyhedral Games. CoRR abs/2402.16316 (2024) - [i62]Yang Cai, Gabriele Farina, Julien Grand-Clément, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Weiqiang Zheng:
Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms. CoRR abs/2406.10631 (2024) - [i61]Constantinos Daskalakis, Gabriele Farina, Noah Golowich, Tuomas Sandholm, Brian Hu Zhang:
A Lower Bound on Swap Regret in Extensive-Form Games. CoRR abs/2406.13116 (2024) - [i60]Mingyang Liu, Gabriele Farina, Asuman E. Ozdaglar:
LiteEFG: An Efficient Python Library for Solving Extensive-form Games. CoRR abs/2407.20351 (2024) - [i59]Mingyang Liu, Gabriele Farina, Asuman E. Ozdaglar:
A Policy-Gradient Approach to Solving Imperfect-Information Games with Iterate Convergence. CoRR abs/2408.00751 (2024) - [i58]Jakub Cerný, Chun Kai Ling, Darshan Chakrabarti, Jingwen Zhang, Gabriele Farina, Christian Kroer, Garud Iyengar:
Contested Logistics: A Game-Theoretic Approach. CoRR abs/2408.13057 (2024) - 2023
- [c54]Anton Bakhtin, David J. Wu, Adam Lerer, Jonathan Gray, Athul Paul Jacob, Gabriele Farina, Alexander H. Miller, Noam Brown:
Mastering the Game of No-Press Diplomacy via Human-Regularized Reinforcement Learning and Planning. ICLR 2023 - [c53]Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Steven Wu, Tuomas Sandholm:
Meta-Learning in Games. ICLR 2023 - [c52]Stephen Marcus McAleer, Gabriele Farina, Marc Lanctot, Tuomas Sandholm:
ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret. ICLR 2023 - [c51]Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm:
Near-Optimal Φ-Regret Learning in Extensive-Form Games. ICML 2023: 814-839 - [c50]Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm:
Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization. ICML 2023: 40996-41018 - [c49]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. NeurIPS 2023 - [c48]Gabriele Farina, Julien Grand-Clément, Christian Kroer, Chung-Wei Lee, Haipeng Luo:
Regret Matching+: (In)Stability and Fast Convergence in Games. NeurIPS 2023 - [c47]Gabriele Farina, Charilaos Pipis:
Polynomial-Time Linear-Swap Regret Minimization in Imperfect-Information Sequential Games. NeurIPS 2023 - [c46]Stephen McAleer, Gabriele Farina, Gaoyue Zhou, Mingzhi Wang, Yaodong Yang, Tuomas Sandholm:
Team-PSRO for Learning Approximate TMECor in Large Team Games via Cooperative Reinforcement Learning. NeurIPS 2023 - [c45]Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen McAleer, Andreas A. Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm:
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. NeurIPS 2023 - [i57]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. CoRR abs/2301.11241 (2023) - [i56]Samuel Sokota, Gabriele Farina, David J. Wu, Hengyuan Hu, Kevin A. Wang, J. Zico Kolter, Noam Brown:
The Update Equivalence Framework for Decision-Time Planning. CoRR abs/2304.13138 (2023) - [i55]Gabriele Farina, Julien Grand-Clément, Christian Kroer, Chung-Wei Lee, Haipeng Luo:
Regret Matching+: (In)Stability and Fast Convergence in Games. CoRR abs/2305.14709 (2023) - [i54]Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm:
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. CoRR abs/2306.05216 (2023) - [i53]Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm:
Steering No-Regret Learners to Optimal Equilibria. CoRR abs/2306.05221 (2023) - [i52]Gabriele Farina, Charilaos Pipis:
Polynomial-Time Linear-Swap Regret Minimization in Imperfect-Information Sequential Games. CoRR abs/2307.05448 (2023) - [i51]Luca Carminati, Brian Hu Zhang, Gabriele Farina, Nicola Gatti, Tuomas Sandholm:
Hidden-Role Games: Equilibrium Concepts and Computation. CoRR abs/2308.16017 (2023) - [i50]Athul Paul Jacob, Yikang Shen, Gabriele Farina, Jacob Andreas:
The Consensus Game: Language Model Generation via Equilibrium Search. CoRR abs/2310.09139 (2023) - [i49]Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm:
Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Extensive-Form Games. CoRR abs/2310.15935 (2023) - [i48]Yang Cai, Gabriele Farina, Julien Grand-Clément, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Weiqiang Zheng:
Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games. CoRR abs/2311.00676 (2023) - [i47]Athul Paul Jacob, Gabriele Farina, Jacob Andreas:
Regularized Conventions: Equilibrium Computation as a Model of Pragmatic Reasoning. CoRR abs/2311.09712 (2023) - [i46]Darshan Chakrabarti, Gabriele Farina, Christian Kroer:
Efficient Learning in Polyhedral Games via Best Response Oracles. CoRR abs/2312.03696 (2023) - [i45]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property. CoRR abs/2312.12067 (2023) - 2022
- [j4]Gabriele Farina
, Andrea Celli, Alberto Marchesi, Nicola Gatti:
Simple Uncoupled No-regret Learning Dynamics for Extensive-form Correlated Equilibrium. J. ACM 69(6): 41:1-41:41 (2022) - [j3]Luca Mesin, Paola Porcu, Debora Russu, Gabriele Farina, Luigi Borzì, Wei Zhang, Yuzhu Guo, Gabriella Olmo:
A Multi-Modal Analysis of the Freezing of Gait Phenomenon in Parkinson's Disease. Sensors 22(7): 2613 (2022) - [c44]Gabriele Farina, Tuomas Sandholm:
Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games. AAAI 2022: 4999-5007 - [c43]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On Last-Iterate Convergence Beyond Zero-Sum Games. ICML 2022: 536-581 - [c42]Gabriele Farina, Chung-Wei Lee, Haipeng Luo, Christian Kroer:
Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games. ICML 2022: 6337-6357 - [c41]Athul Paul Jacob, David J. Wu, Gabriele Farina, Adam Lerer, Hengyuan Hu, Anton Bakhtin, Jacob Andreas, Noam Brown:
Modeling Strong and Human-Like Gameplay with KL-Regularized Search. ICML 2022: 9695-9728 - [c40]Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Tuomas Sandholm:
Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games. NeurIPS 2022 - [c39]Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm:
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. NeurIPS 2022 - [c38]Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-Wei Lee, Christian Kroer, Tuomas Sandholm:
Near-Optimal No-Regret Learning Dynamics for General Convex Games. NeurIPS 2022 - [c37]Brian Hu Zhang, Luca Carminati, Federico Cacciamani, Gabriele Farina, Pierriccardo Olivieri, Nicola Gatti, Tuomas Sandholm:
Subgame Solving in Adversarial Team Games. NeurIPS 2022 - [c36]Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm:
Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. EC 2022: 915-916 - [c35]Brian Hu Zhang, Gabriele Farina, Andrea Celli, Tuomas Sandholm:
Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation. EC 2022: 1119-1120 - [c34]Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm:
Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. STOC 2022: 736-749 - [i44]Gabriele Farina, Chung-Wei Lee, Haipeng Luo, Christian Kroer:
Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games. CoRR abs/2202.00237 (2022) - [i43]Brian Hu Zhang, Gabriele Farina, Tuomas Sandholm:
Team Belief DAG Form: A Concise Representation for Team-Correlated Game-Theoretic Decision Making. CoRR abs/2202.00789 (2022) - [i42]Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm:
Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. CoRR abs/2202.05446 (2022) - [i41]Brian Hu Zhang, Gabriele Farina, Andrea Celli, Tuomas Sandholm:
Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation. CoRR abs/2203.07181 (2022) - [i40]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On Last-Iterate Convergence Beyond Zero-Sum Games. CoRR abs/2203.12056 (2022) - [i39]Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm:
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. CoRR abs/2203.12074 (2022) - [i38]Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Tuomas Sandholm:
Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games. CoRR abs/2204.11417 (2022) - [i37]Stephen McAleer, Gabriele Farina, Marc Lanctot, Tuomas Sandholm:
ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret. CoRR abs/2206.04122 (2022) - [i36]Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-Wei Lee, Christian Kroer, Tuomas Sandholm:
Near-Optimal No-Regret Learning for General Convex Games. CoRR abs/2206.08742 (2022) - [i35]Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm:
Near-Optimal $Φ$-Regret Learning in Extensive-Form Games. CoRR abs/2208.09747 (2022) - [i34]Gabriele Farina, Christian Kroer, Chung-Wei Lee, Haipeng Luo:
Clairvoyant Regret Minimization: Equivalence with Nemirovski's Conceptual Prox Method and Extension to General Convex Games. CoRR abs/2208.14891 (2022) - [i33]Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Zhiwei Steven Wu, Tuomas Sandholm:
Meta-Learning in Games. CoRR abs/2209.14110 (2022) - [i32]Anton Bakhtin, David J. Wu, Adam Lerer, Jonathan Gray, Athul Paul Jacob, Gabriele Farina, Alexander H. Miller, Noam Brown:
Mastering the Game of No-Press Diplomacy via Human-Regularized Reinforcement Learning and Planning. CoRR abs/2210.05492 (2022) - 2021
- [j2]Robin Schmucker, Gabriele Farina, James R. Faeder, Fabian Fröhlich, Ali Sinan Saglam, Tuomas Sandholm:
Combination treatment optimization using a pan-cancer pathway model. PLoS Comput. Biol. 17(12) (2021) - [c33]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent. AAAI 2021: 5363-5371 - [c32]Gabriele Farina, Robin Schmucker, Tuomas Sandholm:
Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games. AAAI 2021: 5372-5380 - [c31]Gabriele Farina, Tuomas Sandholm:
Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games. AAAI 2021: 5381-5390 - [c30]Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm:
Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results. ICML 2021: 3164-3173 - [c29]Andrea Celli, Alberto Marchesi, Gabriele Farina, Nicola Gatti:
Decentralized No-regret Learning Algorithms for Extensive-form Correlated Equilibria (Extended Abstract). IJCAI 2021: 4755-4759 - [c28]Gabriele Farina, Tuomas Sandholm:
Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium. NeurIPS 2021: 8845-8856 - [c27]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria. EC 2021: 432 - [i31]Gabriele Farina, Tuomas Sandholm:
Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games. CoRR abs/2103.04539 (2021) - [i30]Gabriele Farina, Robin Schmucker, Tuomas Sandholm:
Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games. CoRR abs/2103.04546 (2021) - [i29]Gabriele Farina, Andrea Celli, Alberto Marchesi, Nicola Gatti:
Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium. CoRR abs/2104.01520 (2021) - [i28]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria. CoRR abs/2105.12954 (2021) - [i27]Gabriele Farina, Andrea Celli, Tuomas Sandholm:
Efficient Decentralized Learning Dynamics for Extensive-Form Coarse Correlated Equilibrium: No Expensive Computation of Stationary Distributions Required. CoRR abs/2109.08138 (2021) - [i26]Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm:
Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games. CoRR abs/2111.06008 (2021) - [i25]Gabriele Farina, Tuomas Sandholm:
Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games. CoRR abs/2112.03804 (2021) - [i24]Athul Paul Jacob, David J. Wu, Gabriele Farina, Adam Lerer, Anton Bakhtin, Jacob Andreas, Noam Brown:
Modeling Strong and Human-Like Gameplay with KL-Regularized Search. CoRR abs/2112.07544 (2021) - 2020
- [c26]Gabriele Farina, Tommaso Bianchi, Tuomas Sandholm:
Coarse Correlation in Extensive-Form Games. AAAI 2020: 1934-1941 - [c25]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Stochastic Regret Minimization in Extensive-Form Games. ICML 2020: 3018-3028 - [c24]Andrea Celli, Alberto Marchesi, Gabriele Farina, Nicola Gatti:
No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium. NeurIPS 2020 - [c23]Gabriele Farina, Tuomas Sandholm:
Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond. NeurIPS 2020 - [i23]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Stochastic Regret Minimization in Extensive-Form Games. CoRR abs/2002.08493 (2020) - [i22]Andrea Celli, Alberto Marchesi, Gabriele Farina, Nicola Gatti:
No-regret learning dynamics for extensive-form correlated and coarse correlated equilibria. CoRR abs/2004.00603 (2020) - [i21]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent. CoRR abs/2007.14358 (2020) - [i20]Gabriele Farina, Tuomas Sandholm:
Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond. CoRR abs/2009.04336 (2020) - [i19]Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm:
Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games. CoRR abs/2009.10061 (2020)
2010 – 2019
- 2019
- [c22]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games. AAAI 2019: 1917-1925 - [c21]Alberto Marchesi, Gabriele Farina, Christian Kroer, Nicola Gatti, Tuomas Sandholm:
Quasi-Perfect Stackelberg Equilibrium. AAAI 2019: 2117-2124 - [c20]Rui Silva, Gabriele Farina, Francisco S. Melo, Manuela Veloso:
A Theoretical and Algorithmic Analysis of Configurable MDPs. ICAPS 2019: 455-463 - [c19]Gabriele Farina, Christian Kroer, Noam Brown, Tuomas Sandholm:
Stable-Predictive Optimistic Counterfactual Regret Minimization. ICML 2019: 1853-1862 - [c18]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Regret Circuits: Composability of Regret Minimizers. ICML 2019: 1863-1872 - [c17]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium. NeurIPS 2019: 5187-5197 - [c16]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions. NeurIPS 2019: 5222-5232 - [c15]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks. NeurIPS 2019: 9229-9239 - [i18]Gabriele Farina, Christian Kroer, Noam Brown, Tuomas Sandholm:
Stable-Predictive Optimistic Counterfactual Regret Minimization. CoRR abs/1902.04982 (2019) - [i17]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks. CoRR abs/1905.12564 (2019) - [i16]Gabriele Farina, Tommaso Bianchi, Tuomas Sandholm:
Coarse Correlation in Extensive-Form Games. CoRR abs/1908.09893 (2019) - [i15]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions. CoRR abs/1910.10906 (2019) - [i14]Gabriele Farina, Chun Kai Ling, Fei Fang, Tuomas Sandholm:
Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium. CoRR abs/1910.12450 (2019) - 2018
- [c14]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. AAAI Workshops 2018: 294-301 - [c13]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. AAAI 2018: 1130-1137 - [c12]Gabriele Farina, Alberto Marchesi, Christian Kroer, Nicola Gatti, Tuomas Sandholm:
Trembling-Hand Perfection in Extensive-Form Games with Commitment. IJCAI 2018: 233-239 - [c11]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Solving Large Sequential Games with the Excessive Gap Technique. NeurIPS 2018: 872-882 - [c10]Gabriele Farina, Nicola Gatti, Tuomas Sandholm:
Practical exact algorithm for trembling-hand equilibrium refinements in games. NeurIPS 2018: 5044-5054 - [c9]Gabriele Farina, Andrea Celli, Nicola Gatti, Tuomas Sandholm:
Ex ante coordination and collusion in zero-sum multi-player extensive-form games. NeurIPS 2018: 9661-9671 - [i13]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games. CoRR abs/1809.03075 (2018) - [i12]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Solving Large Sequential Games with the Excessive Gap Technique. CoRR abs/1810.03063 (2018) - [i11]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Composability of Regret Minimizers. CoRR abs/1811.02540 (2018) - [i10]Alberto Marchesi, Gabriele Farina, Christian Kroer, Nicola Gatti, Tuomas Sandholm:
Quasi-Perfect Stackelberg Equilibrium. CoRR abs/1811.03871 (2018) - 2017
- [j1]Gabriele Farina, Nicola Gatti:
Adopting the Cascade Model in Ad Auctions: Efficiency Bounds and Truthful Algorithmic Mechanisms. J. Artif. Intell. Res. 59: 265-310 (2017) - [c8]Gabriele Farina, Nicola Gatti:
Extensive-Form Perfect Equilibrium Computation in Two-Player Games. AAAI 2017: 502-508 - [c7]Gabriele Farina, John P. Dickerson, Tuomas Sandholm:
Inter-Club Kidney Exchange. AAAI Workshops 2017 - [c6]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Regret Minimization in Behaviorally-Constrained Zero-Sum Games. ICML 2017: 1107-1116 - [c5]Gabriele Farina, John P. Dickerson, Tuomas Sandholm:
Operation Frames and Clubs in Kidney Exchange. IJCAI 2017: 199-205 - [c4]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Smoothing Method for Approximate Extensive-Form Perfect Equilibrium. IJCAI 2017: 295-301 - [i9]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Smoothing Method for Approximate Extensive-Form Perfect Equilibrium. CoRR abs/1705.09326 (2017) - [i8]Gabriele Farina, John P. Dickerson, Tuomas Sandholm:
Operation Frames and Clubs in Kidney Exchange. CoRR abs/1705.09328 (2017) - [i7]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Regret Minimization in Behaviorally-Constrained Zero-Sum Games. CoRR abs/1711.03441 (2017) - [i6]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. CoRR abs/1711.08080 (2017) - 2016
- [c3]Gabriele Farina, Nicola Gatti:
Ad Auctions and Cascade Model: GSP Inefficiency and Algorithms. AAAI 2016: 489-495 - [c2]Massimo Cairo, Gabriele Farina, Romeo Rizzi:
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. AAAI 2016: 1484-1490 - [i5]Gabriele Farina, Nicola Gatti:
Extensive-Form Perfect Equilibrium Computation in Two-Player Games. CoRR abs/1611.05011 (2016) - 2015
- [c1]Gabriele Farina, Luigi Laura:
Dynamic Subtrees Queries Revisited: The Depth First Tour Tree. IWOCA 2015: 148-160 - [i4]Gabriele Farina, Luigi Laura:
Dynamic subtrees queries revised: the Depth First Tour Tree. CoRR abs/1502.05292 (2015) - [i3]Gabriele Farina:
A linear time algorithm to compute the impact of all the articulation points. CoRR abs/1504.00341 (2015) - [i2]Gabriele Farina, Nicola Gatti:
Ad auctions and cascade model: GSP inefficiency and algorithms. CoRR abs/1511.07397 (2015) - [i1]Massimo Cairo, Gabriele Farina, Romeo Rizzi:
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication. CoRR abs/1512.00077 (2015)
Coauthor Index
[c61] [c56] [i64] [i61] [c53] [c52] [c51] [c50] [c49] [c46] [c45] [i57] [i54] [i53] [i51] [i49] [i45] [c44] [c43] [c40] [c39] [c38] [c37] [c36] [c35] [c34] [i43] [i42] [i41] [i40] [i39] [i38] [i37] [i36] [i35] [i33] [j2] [c33] [c32] [c31] [c30] [c28] [c27] [i31] [i30] [i28] [i27] [i26] [i25] [c26] [c25] [c23] [i23] [i21] [i20] [i19] [c22] [c21] [c19] [c18] [c17] [c16] [c15] [i18] [i17] [i16] [i15] [i14] [c14] [c13] [c12] [c11] [c10] [c9] [i13] [i12] [i11] [i10] [c7] [c6] [c5] [c4] [i9] [i8] [i7] [i6]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
