Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarTuomas Sandholm
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[i40]Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik:
Learning to Branch. CoRR abs/1803.10150 (2018)- 2017
- [j46]
- [c240]Kimmo Berg, Tuomas Sandholm:
Exclusion Method for Finding Nash Equilibrium in Multiplayer Games. AAAI 2017: 383-389 - [c239]Noam Brown, Christian Kroer, Tuomas Sandholm:
Dynamic Thresholding and Pruning for Regret Minimization. AAAI 2017: 421-429 - [c238]John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm:
Small Representations of Big Kidney Exchange Graphs. AAAI 2017: 487-493 - [c237]John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm:
Small Representations of Big Kidney Exchange Graphs. AIORSocGood@AAAI 2017 - [c236]Gabriele Farina, John P. Dickerson, Tuomas Sandholm:
Inter-Club Kidney Exchange. AIORSocGood@AAAI 2017 - [c235]Noam Brown, Tuomas Sandholm:
Reduced Space and Faster Convergence in Imperfect-Information Games via Pruning. ICML 2017: 596-604 - [c234]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Regret Minimization in Behaviorally-Constrained Zero-Sum Games. ICML 2017: 1107-1116 - [c233]Tuomas Sandholm:
Super-Human AI for Strategic Reasoning: Beating Top Pros in Heads-Up No-Limit Texas Hold'em. IJCAI 2017: 24-25 - [c232]Gabriele Farina, John P. Dickerson, Tuomas Sandholm:
Operation Frames and Clubs in Kidney Exchange. IJCAI 2017: 199-205 - [c231]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Smoothing Method for Approximate Extensive-Form Perfect Equilibrium. IJCAI 2017: 295-301 - [c230]
- [c229]Noam Brown, Tuomas Sandholm:
Safe and Nested Subgame Solving for Imperfect-Information Games. NIPS 2017: 689-699 - [c228]Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm:
Theoretical and Practical Advances on Smoothing for Extensive-Form Games. EC 2017: 693 - [i39]Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm:
Theoretical and Practical Advances on Smoothing for Extensive-Form Games. CoRR abs/1702.04849 (2017) - [i38]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Multi-Item Profit Maximization. CoRR abs/1705.00243 (2017) - [i37]Noam Brown, Tuomas Sandholm:
Safe and Nested Subgame Solving for Imperfect-Information Games. CoRR abs/1705.02955 (2017) - [i36]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Smoothing Method for Approximate Extensive-Form Perfect Equilibrium. CoRR abs/1705.09326 (2017) - [i35]Gabriele Farina, John P. Dickerson, Tuomas Sandholm:
Operation Frames and Clubs in Kidney Exchange. CoRR abs/1705.09328 (2017) - [i34]Gabriele Farina, Christian Kroer, Tuomas Sandholm:
Regret Minimization in Behaviorally-Constrained Zero-Sum Games. CoRR abs/1711.03441 (2017) - [i33]Nicola Gatti, Marco Rocco, Tuomas Sandholm:
On the Verification and Computation of Strong Nash Equilibrium. CoRR abs/1711.06318 (2017) - [i32]Christian Kroer, Gabriele Farina, Tuomas Sandholm:
Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead. CoRR abs/1711.08080 (2017) - 2016
- [c227]Noam Brown, Tuomas Sandholm:
Strategy-Based Warm Starting for Regret Minimization in Games. AAAI 2016: 432-438 - [c226]Benjamin Plaut, John P. Dickerson, Tuomas Sandholm:
Fast Optimal Clearing of Capped-Chain Barter Exchanges. AAAI 2016: 601-607 - [c225]Kimmo Berg, Tuomas Sandholm:
Exclusion Method for Finding Nash Equilibrium in Multi-Player Games: (Extended Abstract). AAMAS 2016: 1417-1418 - [c224]Tri-Dung Nguyen, Tuomas Sandholm:
Multi-Option Descending Clock Auction: (Extended Abstract). AAMAS 2016: 1461-1462 - [c223]Fei Peng, Tuomas Sandholm:
Scalable Segment Abstraction Method for Advertising Campaign Admission and Inventory Allocation Optimization. IJCAI 2016: 655-661 - [c222]Christian Kroer, Tuomas Sandholm:
Sequential Planning for Steering Immune System Adaptation. IJCAI 2016: 3177-3184 - [c221]Noam Brown, Tuomas Sandholm:
Baby Tartanian8: Winning Agent from the 2016 Annual Computer Poker Competition. IJCAI 2016: 4238-4239 - [c220]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Automated Mechanism Design. NIPS 2016: 2083-2091 - [c219]John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble:
Position-Indexed Formulations for Kidney Exchange. EC 2016: 25-42 - [c218]Christian Kroer, Tuomas Sandholm:
Imperfect-Recall Abstractions with Bounds in Games. EC 2016: 459-476 - [c217]
- [i31]John P. Dickerson, Aleksandr M. Kazachkov, Ariel D. Procaccia, Tuomas Sandholm:
Small Representations of Big Kidney Exchange Graphs. CoRR abs/1605.07728 (2016) - [i30]Benjamin Plaut, John P. Dickerson, Tuomas Sandholm:
Hardness of the Pricing Problem for Chains in Barter Exchanges. CoRR abs/1606.00117 (2016) - [i29]John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble:
Position-Indexed Formulations for Kidney Exchange. CoRR abs/1606.01623 (2016) - [i28]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Automated Mechanism Design. CoRR abs/1606.04145 (2016) - [i27]Noam Brown, Tuomas Sandholm:
Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning. CoRR abs/1609.03234 (2016) - [i26]Swaprava Nath, Tuomas Sandholm:
Efficiency and Budget Balance in General Quasi-linear Domains. CoRR abs/1610.01443 (2016) - 2015
- [j45]Tuomas Sandholm, Anton Likhodedov:
Automated Design of Revenue-Maximizing Combinatorial Auctions. Operations Research 63(5): 1000-1025 (2015) - [j44]Sam Ganzfried, Tuomas Sandholm:
Safe Opponent Exploitation. ACM Trans. Economics and Comput. 3(2): 8:1-8:28 (2015) - [c216]John P. Dickerson, Tuomas Sandholm:
FutureMatch: Combining Human Value Judgments and Machine Learning to Match in Dynamic Environments. AAAI 2015: 622-628 - [c215]Chen Hajaj, John P. Dickerson, Avinatan Hassidim, Tuomas Sandholm, David Sarne:
Strategy-Proof and Efficient Kidney Exchange Using a Credit Mechanism. AAAI 2015: 921-928 - [c214]Tuomas Sandholm:
Steering Evolution Strategically: Computational Game Theory and Opponent Exploitation for Treatment Planning, Drug Design, and Synthetic Biology. AAAI 2015: 4057-4061 - [c213]Noam Brown, Sam Ganzfried, Tuomas Sandholm:
Tartanian7: A Champion Two-Player No-Limit Texas Hold'em Poker-Playing Program. AAAI 2015: 4270-4271 - [c212]Noam Brown, Sam Ganzfried, Tuomas Sandholm:
Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent. AAAI Workshop: Computer Poker and Imperfect Information 2015 - [c211]Sam Ganzfried, Tuomas Sandholm:
Endgame Solving in Large Imperfect-Information Games. AAAI Workshop: Computer Poker and Imperfect Information 2015 - [c210]
- [c209]Noam Brown, Sam Ganzfried, Tuomas Sandholm:
Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent. AAMAS 2015: 7-15 - [c208]Sam Ganzfried, Tuomas Sandholm:
Endgame Solving in Large Imperfect-Information Games. AAMAS 2015: 37-45 - [c207]Christian Kroer, Tuomas Sandholm:
Discretization of Continuous Action Spaces in Extensive-Form Games. AAMAS 2015: 47-56 - [c206]
- [c205]Noam Brown, Tuomas Sandholm:
Simultaneous Abstraction and Equilibrium Finding in Games. IJCAI 2015: 489-496 - [c204]Christian Kroer, Tuomas Sandholm:
Limited Lookahead in Imperfect-Information Games. IJCAI 2015: 575-581 - [c203]
- [c202]Avrim Blum, John P. Dickerson, Nika Haghtalab, Ariel D. Procaccia, Tuomas Sandholm, Ankit Sharma:
Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries. EC 2015: 325-342 - [c201]Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm:
Faster First-Order Methods for Extensive-Form Game Solving. EC 2015: 817-834 - 2014
- [c200]
- [c199]Sam Ganzfried, Tuomas Sandholm:
Potential-Aware Imperfect-Recall Abstraction with Earth Mover's Distance in Imperfect-Information Games. AAAI 2014: 682-690 - [c198]John P. Dickerson, Jonathan R. Goldman, Jeremy Karp, Ariel D. Procaccia, Tuomas Sandholm:
The Computational Rise and Fall of Fairness. AAAI 2014: 1405-1411 - [c197]John P. Dickerson, Tuomas Sandholm:
Multi-Organ Exchange: The Whole Is Greater than the Sum of its Parts. AAAI 2014: 1412-1418 - [c196]John Paul Dickerson, Tuomas Sandholm:
Balancing Efficiency and Fairness in Dynamic Kidney Exchange. AAAI Workshop: Modern Artificial Intelligence for Health Analytics 2014 - [c195]John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm:
Price of fairness in kidney exchange. AAMAS 2014: 1013-1020 - [c194]Nicola Gatti, Tuomas Sandholm:
Finding the pareto curve in bimatrix games is easy. AAMAS 2014: 1217-1224 - [c193]Albert Xin Jiang, Leandro Soriano Marcolino, Ariel D. Procaccia, Tuomas Sandholm, Nisarg Shah, Milind Tambe:
Diverse Randomized Agents Vote to Win. NIPS 2014: 2573-2581 - [c192]
- [c191]
- [c190]Bruce DeBruhl, Christian Kroer, Anupam Datta, Tuomas Sandholm, Patrick Tague:
Power napping with loud neighbors: optimal energy-constrained jamming and anti-jamming. WISEC 2014: 117-128 - [i25]Michael Benisch, George B. Davis, Tuomas Sandholm:
Algorithms for Closed Under Rational Behavior (CURB) Sets. CoRR abs/1401.3855 (2014) - [i24]
- [i23]Christian Kroer, Tuomas Sandholm:
Extensive-Form Game Imperfect-Recall Abstractions With Bounds. CoRR abs/1409.3302 (2014) - 2013
- [j43]Abraham Othman, David M. Pennock, Daniel M. Reeves, Tuomas Sandholm:
A Practical Liquidity-Sensitive Automated Market Maker. ACM Trans. Economics and Comput. 1(3): 14:1-14:25 (2013) - [c189]John Paul Dickerson, Tuomas Sandholm:
Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates is Moderate. AAAI (Late-Breaking Developments) 2013 - [c188]Nicola Gatti, Marco Rocco, Tuomas Sandholm:
Algorithms for Strong Nash Equilibrium with More than Two Agents. AAAI 2013 - [c187]Nicola Gatti, Marco Rocco, Tuomas Sandholm:
Strong Nash Equilibrium Is in Smoothed P. AAAI (Late-Breaking Developments) 2013 - [c186]Nicola Gatti, Marco Rocco, Tuomas Sandholm:
On the verification and computation of strong nash equilibrium. AAMAS 2013: 723-730 - [c185]Sam Ganzfried, Tuomas Sandholm:
Action Translation in Extensive-Form Games with Large Action Spaces: Axioms, Paradoxes, and the Pseudo-Harmonic Mapping. IJCAI 2013: 120-128 - [c184]Xin Sui, Craig Boutilier, Tuomas Sandholm:
Analysis and Optimization of Multi-Dimensional Percentile Mechanisms. IJCAI 2013: 367-374 - [c183]John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm:
Failure-aware kidney exchange. EC 2013: 323-340 - [c182]John Paul Dickerson, Tuomas Sandholm:
Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates Is Moderate. SOCS 2013 - [i22]Nicola Gatti, Marco Rocco, Tuomas Sandholm:
On the complexity of strong Nash equilibrium: Hard-to-solve instances and smoothed complexity. CoRR abs/1304.1351 (2013) - 2012
- [j42]Zhengyu Yin, Albert Xin Jiang, Milind Tambe, Christopher Kiekintveld, Kevin Leyton-Brown, Tuomas Sandholm, John P. Sullivan:
TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems Using Game Theory. AI Magazine 33(4): 59-72 (2012) - [j41]Vincent Conitzer, Tuomas Sandholm:
Computing optimal outcomes under an expressive representation of settings with externalities. J. Comput. Syst. Sci. 78(1): 2-14 (2012) - [j40]Andrew Gilpin, Javier Peña, Tuomas Sandholm:
First-order algorithm with 𝒪(ln(1/ε)) convergence for ε-equilibrium in two-person zero-sum games. Math. Program. 133(1-2): 279-298 (2012) - [c181]John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm:
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange. AAAI 2012 - [c180]
- [c179]Albert Xin Jiang, Zhengyu Yin, Matthew P. Johnson, Milind Tambe, Christopher Kiekintveld, Kevin Leyton-Brown, Tuomas Sandholm:
Towards Optimal Patrol Strategies for Fare Inspection in Transit Systems. AAAI Spring Symposium: Game Theory for Security, Sustainability, and Health 2012 - [c178]Abraham Othman, Tuomas Sandholm:
Rational market making with probabilistic knowledge. AAMAS 2012: 645-652 - [c177]John P. Dickerson, Ariel D. Procaccia, Tuomas Sandholm:
Optimizing kidney exchange with transplant chains: theory and reality. AAMAS 2012: 711-718 - [c176]
- [c175]Sam Ganzfried, Tuomas Sandholm, Kevin Waugh:
Strategy purification and thresholding: effective non-equilibrium approaches for playing large games. AAMAS 2012: 871-878 - [c174]Zhengyu Yin, Albert Xin Jiang, Matthew Paul Johnson, Christopher Kiekintveld, Kevin Leyton-Brown, Tuomas Sandholm, Milind Tambe, John P. Sullivan:
TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems. IAAI 2012 - [c173]
- [c172]Abraham Othman, Tuomas Sandholm:
Profit-charging market makers with bounded loss, vanishing bid/ask spreads, and unlimited market depth. EC 2012: 790-807 - [c171]
- [c170]Nicola Gatti, Giorgio Patrini, Marco Rocco, Tuomas Sandholm:
Combining local search techniques and path following for bimatrix games. UAI 2012: 286-295 - [i21]Vincent Conitzer, Tuomas Sandholm:
Common Voting Rules as Maximum Likelihood Estimators. CoRR abs/1207.1368 (2012) - [i20]Nicola Gatti, Giorgio Patrini, Marco Rocco, Tuomas Sandholm:
Combining local search techniques and path following for bimatrix games. CoRR abs/1210.4858 (2012) - 2011
- [j39]Abraham Othman, Tuomas Sandholm:
Inventory-based versus Prior-based Options Trading Agents. Algorithmic Finance 1(2): 95-121 (2011) - [j38]Vincent Conitzer, Tuomas Sandholm:
Expressive markets for donating to charities. Artif. Intell. 175(7-8): 1251-1271 (2011) - [j37]Andrew Gilpin, Tuomas Sandholm:
Information-theoretic approaches to branching in search. Discrete Optimization 8(2): 147-159 (2011) - [c169]Sam Ganzfried, Tuomas Sandholm, Kevin Waugh:
Strategy Purification. Applied Adversarial Reasoning and Risk Modeling 2011 - [c168]Abraham Othman, Tuomas Sandholm:
Automated Market Makers That Enable New Settings: Extending Constant-Utility Cost Functions. AMMA 2011: 19-30 - [c167]Michael Benisch, Tuomas Sandholm:
A Framework for Automated Bundling and Pricing Using Purchase Data. AMMA 2011: 40-52 - [c166]Sam Ganzfried, Tuomas Sandholm:
Game theory-based opponent modeling in large imperfect-information games. AAMAS 2011: 533-540 - [c165]
- [c164]Pingzhong Tang, Tuomas Sandholm:
Approximating Optimal Combinatorial Auctions for Complements Using Restricted Welfare Maximization. IJCAI 2011: 379-385 - [c163]Abraham Othman, Tuomas Sandholm:
Liquidity-Sensitive Automated Market Makers via Homogeneous Risk Measures. WINE 2011: 314-325 - 2010
- [j36]Tuomas Sandholm:
The State of Solving Large Incomplete-Information Games, and Application to Poker. AI Magazine 31(4): 13-32 (2010) - [j35]Michael Benisch, George B. Davis, Tuomas Sandholm:
Algorithms for Closed Under Rational Behavior (CURB) Sets. J. Artif. Intell. Res. 38: 513-534 (2010) - [j34]Samid Hoda, Andrew Gilpin, Javier Peña, Tuomas Sandholm:
Smoothing Techniques for Computing Nash Equilibria of Sequential Games. Math. Oper. Res. 35(2): 494-512 (2010) - [c162]Abraham Othman, Tuomas Sandholm:
Envy Quotes and the Iterated Core-Selecting Combinatorial Auction. AAAI 2010 - [c161]
- [c160]William E. Walsh, Craig Boutilier, Tuomas Sandholm, Rob Shields, George L. Nemhauser, David C. Parkes:
Automated Channel Abstraction for Advertising Auctions. AAAI 2010 - [c159]Sam Ganzfried, Tuomas Sandholm:
Computing equilibria by incorporating qualitative models? AAMAS 2010: 183-190 - [c158]
- [c157]
- [c156]Abraham Othman, Tuomas Sandholm, Eric Budish:
Finding approximate competitive equilibria: efficient and fair course allocation. AAMAS 2010: 873-880 - [c155]Andrew Gilpin, Tuomas Sandholm:
Speeding up gradient-based algorithms for sequential games. AAMAS 2010: 1463-1464 - [c154]Piotr Krysta, Tomasz P. Michalak, Tuomas Sandholm, Michael Wooldridge:
Combinatorial auctions with externalities. AAMAS 2010: 1471-1472 - [c153]Abraham Othman, Tuomas Sandholm:
Automated market-making in the large: the gates hillman prediction market. EC 2010: 367-376 - [c152]Abraham Othman, Tuomas Sandholm, David M. Pennock, Daniel M. Reeves:
A practical liquidity-sensitive automated market maker. EC 2010: 377-386
2000 – 2009
- 2009
- [c151]Michael Benisch, Norman M. Sadeh, Tuomas Sandholm:
Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions. IJCAI 2009: 46-52 - [c150]Sam Ganzfried, Tuomas Sandholm:
Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information. IJCAI 2009: 140-146 - [c149]Abraham Othman, Tuomas Sandholm:
How Pervasive Is the Myerson-Satterthwaite Impossibility? IJCAI 2009: 233-238 - [c148]Pranjal Awasthi, Tuomas Sandholm:
Online Stochastic Optimization in the Large: Application to Kidney Exchange. IJCAI 2009: 405-411 - [c147]Abraham Othman, Tuomas Sandholm:
Better with Byzantine: Manipulation-Optimal Mechanisms. SAGT 2009: 60-71 - [c146]Michael Benisch, Patrick Gage Kelley, Norman M. Sadeh, Tuomas Sandholm, Janice Y. Tsai, Lorrie Faith Cranor, Paul Hankes Drielsma:
The impact of expressiveness on the effectiveness of privacy mechanisms for location-sharing. SOUPS 2009 - 2008
- [j33]Vincent Conitzer, Tuomas Sandholm:
New complexity results about Nash equilibria. Games and Economic Behavior 63(2): 621-641 (2008) - [j32]