218 citations · 909 across the 108 of their papers we have counts for
10 papers · 1 filter
Fast Payoff Matrix Sparsification Techniques for Structured Extensive-Form Games
Gabriele Farina, Tuomas Sandholm
The practical scalability of many optimization algorithms for large extensive-form games is often limited by the games' huge payoff matrices. To ameliorate the issue, Zhang and San…
Improved Sample Complexity Bounds for Branch-and-Cut
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm +1
Branch-and-cut is the most widely used algorithm for solving integer programs, employed by commercial solvers like CPLEX and Gurobi. Branch-and-cut has a wide variety of tunable pa…
Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games
Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina +3
Recently, Daskalakis, Fishelson, and Golowich (DFG) (NeurIPS`21) showed that if all agents in a multi-player general-sum normal-form game employ Optimistic Multiplicative Weights U…
Efficient Decentralized Learning Dynamics for Extensive-Form Coarse Correlated Equilibrium: No Expensive Computation of Stationary Distributions Required
Gabriele Farina, Andrea Celli, Tuomas Sandholm
While in two-player zero-sum games the Nash equilibrium is a well-established prescriptive notion of optimal play, its applicability as a prescriptive tool beyond that setting is l…
Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions
Brian Hu Zhang, Tuomas Sandholm
Despite the many recent practical and theoretical breakthroughs in computational game theory, equilibrium finding in extensive-form team games remains a significant challenge. Whil…
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm +1
Cutting-plane methods have enabled remarkable successes in integer programming over the last few decades. State-of-the-art solvers integrate a myriad of cutting-plane techniques to…