conftrace_

Gabriele Farina

56 papers · 2017–2025 · 7 conferences · across top CS/AI conferences

Achievements

Jump to papers ↓
+15 more ↓ πŸƒ Academic Marathon (8) 🌍 Conference Polyglot (7) 🧭 Keyword Pioneer πŸŒ‰ Interdisciplinary Bridge 🐝 Cross-Pollinator (14)
🐝 Cross-Pollinator (14) 🌈 Renaissance Researcher (6) πŸ—ΊοΈ Taxonomy Completionist (29) 🏠 Conference Loyalist (22) πŸ† Grand Slam πŸ”¬ Deep Specialist (42) 🀝 Dynamic Duo (39) πŸ† Keyword Champion (3) πŸ‘‘ Triple Crown πŸ’Ž Century Club (56) πŸ“ˆ Trend Setter πŸ”₯ Unstoppable (9) ⚑ Prolific Year (10) πŸš€ Conference Pioneer πŸ—ƒοΈ Keyword Collector (134)

Conferences

NIPS (22) ICML (11) AAAI (9) ICLR (8) IJCAI (4) COLT (1) NAACL (1)

Papers

A Policy-Gradient Approach to Solving Imperfect-Information Games with Best-Iterate Convergence ICLR 2025 Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries COLT 2025 Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games ICLR 2025 Expected Variational Inequalities ICML 2025 Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Sequential Games ICLR 2024 The Consensus Game: Language Model Generation via Equilibrium Search ICLR 2024 Efficient Learning in Polyhedral Games via Best-Response Oracles AAAI 2024 Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property AAAI 2024 Efficient $\Phi$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games NIPS 2024 On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games NIPS 2024 Regularized Conventions: Equilibrium Computation as a Model of Pragmatic Reasoning NAACL 2024 The Update-Equivalence Framework for Decision-Time Planning ICLR 2024 Polynomial-Time Computation of Exact $\Phi$-Equilibria in Polyhedral Games NIPS 2024 Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms NIPS 2024 Near-Optimal $Ξ¦$-Regret Learning in Extensive-Form Games ICML 2023 Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games NIPS 2023 On the Convergence of No-Regret Learning Dynamics in Time-Varying Games NIPS 2023 Polynomial-Time Linear-Swap Regret Minimization in Imperfect-Information Sequential Games NIPS 2023 Team-PSRO for Learning Approximate TMECor in Large Team Games via Cooperative Reinforcement Learning NIPS 2023 Regret Matching+: (In)Stability and Fast Convergence in Games NIPS 2023 ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret ICLR 2023 Meta-Learning in Games ICLR 2023 Mastering the Game of No-Press Diplomacy via Human-Regularized Reinforcement Learning and Planning ICLR 2023 Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization ICML 2023 Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games AAAI 2022 On Last-Iterate Convergence Beyond Zero-Sum Games ICML 2022 Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games ICML 2022 Modeling Strong and Human-Like Gameplay with KL-Regularized Search ICML 2022 Uncoupled Learning Dynamics with $O(\log T)$ Swap Regret in Multiplayer Games NIPS 2022 Subgame Solving in Adversarial Team Games NIPS 2022 Near-Optimal No-Regret Learning Dynamics for General Convex Games NIPS 2022 Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games NIPS 2022 Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games AAAI 2021 Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent AAAI 2021 Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games AAAI 2021 Equilibrium Refinement for the Age of Machines: The One-Sided Quasi-Perfect Equilibrium NIPS 2021 Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results ICML 2021 Decentralized No-regret Learning Algorithms for Extensive-form Correlated Equilibria (Extended Abstract) IJCAI 2021 Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond NIPS 2020 Stochastic Regret Minimization in Extensive-Form Games ICML 2020 Coarse Correlation in Extensive-Form Games AAAI 2020 No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium NIPS 2020 Quasi-Perfect Stackelberg Equilibrium AAAI 2019 Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions NIPS 2019 Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium NIPS 2019 Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarks NIPS 2019 Stable-Predictive Optimistic Counterfactual Regret Minimization ICML 2019 Regret Circuits: Composability of Regret Minimizers ICML 2019 Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games AAAI 2019 Trembling-Hand Perfection in Extensive-Form Games with Commitment IJCAI 2018 Practical exact algorithm for trembling-hand equilibrium refinements in games NIPS 2018 Ex ante coordination and collusion in zero-sum multi-player extensive-form games NIPS 2018 Solving Large Sequential Games with the Excessive Gap Technique NIPS 2018 Regret Minimization in Behaviorally-Constrained Zero-Sum Games ICML 2017 Operation Frames and Clubs in Kidney Exchange IJCAI 2017 Smoothing Method for Approximate Extensive-Form Perfect Equilibrium IJCAI 2017