218 citations · 909 across the 108 of their papers we have counts for
123 papers
Efficient representations for team and imperfect-recall equilibrium computation
Luca Carminati, Brian Hu Zhang, Federico Cacciamani +4
Equilibrium finding in two-player zero-sum games with perfect recall is a well-studied topic that has led to many breakthroughs in computational game theory. This paper aims to gen…
Revenue-Optimal Efficient Mechanism Design with General Type Spaces
Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
We derive the revenue-optimal efficient (welfare-maximizing) mechanism in a general multidimensional mechanism design setting when type spaces -- that is, the underlying domains fr…
Weakest Bidder Types and New Core-Selecting Combinatorial Auctions
Siddharth Prasad, Maria-Florina Balcan, Tuomas Sandholm
Core-selecting combinatorial auctions are popular auction designs that constrain prices to eliminate the incentive for any group of bidders -- with the seller -- to renegotiate for…
A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition
Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm +1
Solving (Stampacchia) variational inequalities (SVIs) is a foundational problem at the heart of optimization. However, this expressivity comes at the cost of computational hardness…
Expected Variational Inequalities
Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde +4
Variational inequalities (VIs) encompass many fundamental problems in diverse areas ranging from engineering to economics and machine learning. However, their considerable expressi…
Computing Game Symmetries and Equilibria That Respect Them
Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld +2
Strategic interactions can be represented more concisely, and analyzed and solved more efficiently, if we are aware of the symmetries within the multiagent system. Symmetries also…