| Year |
Citation |
Score |
| 2020 |
Blum A, Dickerson JP, Haghtalab N, Procaccia AD, Sandholm T, Sharma A. Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries Operations Research. 68: 16-34. DOI: 10.1287/Opre.2019.1856 |
0.34 |
|
| 2020 |
Kroer C, Sandholm T. Limited lookahead in imperfect-information games Artificial Intelligence. 283: 103218. DOI: 10.1016/J.Artint.2019.103218 |
0.465 |
|
| 2020 |
Kroer C, Waugh K, Kılınç-Karzan F, Sandholm T. Faster algorithms for extensive-form game solving via improved smoothing functions Mathematical Programming. 179: 385-417. DOI: 10.1007/S10107-018-1336-7 |
0.419 |
|
| 2020 |
Braggion E, Gatti N, Lucchetti R, Sandholm T, Stengel Bv. Strong Nash equilibria and mixed strategies International Journal of Game Theory. 1-12. DOI: 10.1007/S00182-020-00723-3 |
0.415 |
|
| 2019 |
Brown N, Sandholm T. Superhuman AI for multiplayer poker. Science (New York, N.Y.). PMID 31296650 DOI: 10.1126/Science.Aay2400 |
0.417 |
|
| 2019 |
Marchesi A, Farina G, Kroer C, Gatti N, Sandholm T. Quasi-Perfect Stackelberg Equilibrium Proceedings of the Aaai Conference On Artificial Intelligence. 33: 2117-2124. DOI: 10.1609/aaai.v33i01.33012117 |
0.324 |
|
| 2019 |
Farina G, Kroer C, Sandholm T. Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games Proceedings of the Aaai Conference On Artificial Intelligence. 33: 1917-1925. DOI: 10.1609/aaai.v33i01.33011917 |
0.365 |
|
| 2019 |
Brown N, Sandholm T. Solving Imperfect-Information Games via Discounted Regret Minimization Proceedings of the Aaai Conference On Artificial Intelligence. 33: 1829-1836. DOI: 10.1609/aaai.v33i01.33011829 |
0.379 |
|
| 2019 |
Dickerson JP, Procaccia AD, Sandholm T. Failure-Aware Kidney Exchange Management Science. 65: 1768-1791. DOI: 10.1287/Mnsc.2018.3026 |
0.339 |
|
| 2019 |
Nath S, Sandholm T. Efficiency and budget balance in general quasi-linear domains Games and Economic Behavior. 113: 673-693. DOI: 10.1016/J.Geb.2018.11.010 |
0.336 |
|
| 2017 |
Brown N, Sandholm T. Superhuman AI for heads-up no-limit poker: Libratus beats top professionals. Science (New York, N.Y.). PMID 29249696 DOI: 10.1126/Science.Aao1733 |
0.477 |
|
| 2015 |
Sandholm T. Computer science. Solving imperfect-information games. Science (New York, N.Y.). 347: 122-3. PMID 25574004 DOI: 10.1126/Science.Aaa4614 |
0.414 |
|
| 2015 |
Sandholm T, Likhodedov A. Automated Design of Revenue-Maximizing Combinatorial Auctions Operations Research. 63: 1000-1025. DOI: 10.1287/Opre.2015.1398 |
0.392 |
|
| 2015 |
Kroer C, Waugh K, Kilinç-Karzan F, Sandholm T. Faster first-order methods for extensive-form game solving Ec 2015 - Proceedings of the 2015 Acm Conference On Economics and Computation. 817-834. DOI: 10.1145/2764468.2764476 |
0.324 |
|
| 2015 |
Ganzfried S, Sandholm T. Safe Opponent Exploitation Acm Transactions On Economics and Computation. 3: 1-28. DOI: 10.1145/2716322 |
0.356 |
|
| 2014 |
Debruhl B, Kroer C, Datta A, Sandholm T, Tague P. Power napping with loud neighbors: Optimal energy-constrained jamming and anti-jamming Wisec 2014 - Proceedings of the 7th Acm Conference On Security and Privacy in Wireless and Mobile Networks. 117-128. DOI: 10.1145/2627393.2627406 |
0.3 |
|
| 2013 |
Othman A, Pennock DM, Reeves DM, Sandholm T. A Practical Liquidity-Sensitive Automated Market Maker Acm Transactions On Economics and Computation. 1: 1-25. DOI: 10.1145/2509413.2509414 |
0.318 |
|
| 2013 |
Othman A, Sandholm T. The Gates Hillman prediction market Review of Economic Design. 17: 95-128. DOI: 10.1007/S10058-013-0144-Z |
0.58 |
|
| 2012 |
Othman A, Sandholm T. Inventory-based versus Prior-based Options Trading Agents Algorithmic Finance. 1: 95-121. DOI: 10.3233/AF-2011-009 |
0.367 |
|
| 2012 |
Yin Z, Jiang AX, Tambe M, Kiekintveld C, Leyton-Brown K, Sandholm T, Sullivan JP. TRUSTS: Scheduling randomized patrols for fare inspection in transit systems using game theory Ai Magazine. 33: 59-72. DOI: 10.1609/Aimag.V33I4.2432 |
0.391 |
|
| 2012 |
Conitzer V, Sandholm T. Computing optimal outcomes under an expressive representation of settings with externalities Journal of Computer and System Sciences. 78: 2-14. DOI: 10.1016/J.Jcss.2011.02.009 |
0.388 |
|
| 2012 |
Gilpin A, Peña J, Sandholm T. First-order algorithm with O(ln1/ε)) convergence for ε-equilibrium in two-person zero-sum games Mathematical Programming. 133: 279-298. DOI: 10.1007/S10107-010-0430-2 |
0.696 |
|
| 2012 |
Othman A, Sandholm T. Automated market makers that enable new settings: Extending constant-utility cost functions Lecture Notes of the Institute For Computer Sciences, Social-Informatics and Telecommunications Engineering. 80: 19-30. DOI: 10.1007/978-3-642-30913-7_5 |
0.343 |
|
| 2012 |
Benisch M, Sandholm T. A framework for automated bundling and pricing using purchase data Lecture Notes of the Institute For Computer Sciences, Social-Informatics and Telecommunications Engineering. 80: 40-52. DOI: 10.1007/978-3-642-30913-7_11 |
0.305 |
|
| 2011 |
Gilpin A, Sandholm T. Information-theoretic approaches to branching in search Discrete Optimization. 8: 147-159. DOI: 10.1016/J.Disopt.2010.07.001 |
0.674 |
|
| 2011 |
Conitzer V, Sandholm T. Expressive markets for donating to charities Artificial Intelligence. 175: 1251-1271. DOI: 10.1016/J.Artint.2010.11.007 |
0.397 |
|
| 2010 |
Benisch M, Davis GB, Sandholm T. Algorithms for closed under rational behavior (CURB) sets Journal of Artificial Intelligence Research. 38: 513-534. DOI: 10.1613/Jair.3070 |
0.464 |
|
| 2010 |
Sandholm T. The State of Solving Large Incomplete-Information Games, and Application to Poker Ai Magazine. 31: 13-32. DOI: 10.1609/Aimag.V31I4.2311 |
0.431 |
|
| 2010 |
Hoda S, Gilpin A, Peña J, Sandholm T. Smoothing techniques for computing nash equilibria of sequential games Mathematics of Operations Research. 35: 494-512. DOI: 10.1287/Moor.1100.0452 |
0.699 |
|
| 2010 |
Othman A, Sandholm T. Automated market-making in the large: The Gates Hillman prediction market Proceedings of the Acm Conference On Electronic Commerce. 367-376. DOI: 10.1145/1807342.1807401 |
0.327 |
|
| 2008 |
Brandt F, Sandholm T. On the Existence of Unconditionally Privacy-Preserving Auction Protocols Acm Transactions On Information and System Security. 11: 6. DOI: 10.1145/1330332.1330338 |
0.414 |
|
| 2007 |
Sandholm T. Expressive Commerce and Its Application to Sourcing: How We Conducted $35 Billion of Generalized Combinatorial Auctions Ai Magazine. 28: 45-58. DOI: 10.1609/Aimag.V28I3.2054 |
0.422 |
|
| 2007 |
Gilpin A, Sandholm T. Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker Proceedings of the International Conference On Autonomous Agents. 1176-1183. DOI: 10.1145/1329125.1329358 |
0.404 |
|
| 2007 |
Gilpin A, Sandholm T. Lossless abstraction of imperfect information games Journal of the Acm. 54. DOI: 10.1145/1284320.1284324 |
0.7 |
|
| 2007 |
Conitzer V, Sandholm T, Lang J. When are elections with few candidates hard to manipulate Journal of the Acm. 54. DOI: 10.1145/1236457.1236461 |
0.412 |
|
| 2007 |
Sandholm T. Perspectives on multiagent learning Artificial Intelligence. 171: 382-391. DOI: 10.1016/J.Artint.2007.02.004 |
0.343 |
|
| 2007 |
Conitzer V, Sandholm T. AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents Machine Learning. 67: 23-43. DOI: 10.1007/S10994-006-0143-1 |
0.425 |
|
| 2006 |
Sandholm T, Levine D, Concordia M, Martyn P, Hughes R, Jacobs J, Begg D. Changing the Game in Strategic Sourcing at Procter & Gamble: Expressive Competition Enabled by Optimization Interfaces. 36: 55-68. DOI: 10.1287/Inte.1050.0185 |
0.329 |
|
| 2006 |
Blum A, Sandholm T, Zinkevich M. Online algorithms for market clearing Journal of the Acm. 53: 845-879. DOI: 10.1145/1183907.1183913 |
0.496 |
|
| 2006 |
Gilpin A, Sandholm T. A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation Proceedings of the International Conference On Autonomous Agents. 2006: 1453-1454. DOI: 10.1145/1160633.1160911 |
0.307 |
|
| 2006 |
Sandholm T, Gilpin A. Sequences of take-it-or-leave-it offers: Near-optimal auctions without full valuation revelation Proceedings of the International Conference On Autonomous Agents. 2006: 1127-1134. DOI: 10.1145/1160633.1160839 |
0.327 |
|
| 2006 |
Sandholm T, Suri S. Side constraints and non-price attributes in markets Games and Economic Behavior. 55: 321-330. DOI: 10.1016/J.Geb.2005.06.001 |
0.421 |
|
| 2006 |
Conitzer V, Sandholm T. Complexity of constructing solutions in the core based on synergies among coalitions Artificial Intelligence. 170: 607-619. DOI: 10.1016/J.Artint.2006.01.005 |
0.415 |
|
| 2006 |
Yokoo M, Conitzer V, Sandholm T, Ohta N, Iwasaki A. A new solution concept for coalitional games in open anonymous environments Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4012: 53-64. DOI: 10.1007/11780496_6 |
0.351 |
|
| 2005 |
Sandholm T, Suri S, Gilpin A, Levine D. CABOB: A fast optimal algorithm for winner determination in combinatorial auctions Management Science. 51: 374-390. DOI: 10.1287/Mnsc.1040.0336 |
0.706 |
|
| 2004 |
Blum A, Jackson J, Sandholm T, Zinkevich M. Preference Elicitation and Query Learning Journal of Machine Learning Research. 5: 649-667. DOI: 10.1007/978-3-540-45167-9_3 |
0.309 |
|
| 2004 |
Conitzer V, Sandholm T. An algorithm for automatically designing deterministic mechanisms without payments Proceedings of the Third International Joint Conference On Autonomous Agents and Multiagent Systems, Aamas 2004. 1: 128-135. |
0.305 |
|
| 2003 |
Sandholm T, Suri S. BOB: improved winner determination in combinatorial auctions and generalizations Artificial Intelligence. 145: 33-58. DOI: 10.1016/S0004-3702(03)00015-8 |
0.435 |
|
| 2003 |
Suri S, Sandholm T, Warkhede PR. Compressing Two-Dimensional Routing Tables Algorithmica. 35: 287-300. DOI: 10.1007/S00453-002-1000-7 |
0.322 |
|
| 2003 |
Conitzer V, Sandholm T. Complexity of determining nonemptiness of the core Proceedings of the Acm Conference On Electronic Commerce. 230-231. |
0.306 |
|
| 2002 |
Sandholm T, Lesser V. Leveled-commitment contracting: a backtracking instrument for multiagent systems Ai Magazine. 23: 89-100. DOI: 10.1609/Aimag.V23I3.1659 |
0.387 |
|
| 2002 |
Sandholm T, Zhou Y. Surplus equivalence of leveled commitment contracts Artificial Intelligence. 142: 239-264. DOI: 10.1016/S0004-3702(02)00275-8 |
0.369 |
|
| 2002 |
Sandholm T. Algorithm for optimal winner determination in combinatorial auctions Artificial Intelligence. 135: 1-54. DOI: 10.1016/S0004-3702(01)00159-X |
0.45 |
|
| 2002 |
Hudson B, Sandholm T. Effectiveness of Preference Elicitation in Combinatorial Auctions Lecture Notes in Computer Science. 69-86. DOI: 10.1007/3-540-36378-5_5 |
0.368 |
|
| 2002 |
Conen W, Sandholm T. Differential -Revelation VCG Mechanisms for Combinatorial Auctions Lecture Notes in Computer Science. 34-51. DOI: 10.1007/3-540-36378-5_3 |
0.422 |
|
| 2001 |
Larson K, Sandholm T. Bargaining with limited computation: deliberation equilibrium Artificial Intelligence. 132: 183-217. DOI: 10.1016/S0004-3702(01)00132-1 |
0.714 |
|
| 2000 |
Sandholm T, Huai Q. Nomad: mobile agent system for an Internet-based auction house Ieee Internet Computing. 4: 80-86. DOI: 10.1109/4236.832950 |
0.327 |
|
| 2000 |
Sandholm T. Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation Autonomous Agents and Multi-Agent Systems. 3: 73-96. DOI: 10.1023/A:1010038012192 |
0.369 |
|
| 1999 |
Tohmé F, Sandholm T. Coalition formation processes with belief revision among bounded-rational self-interested agents Journal of Logic and Computation. 9: 793-815. DOI: 10.1093/Logcom/9.6.793 |
0.335 |
|
| 1999 |
Sandholm T, Larson K, Andersson M, Shehory O, Tohmé F. Coalition structure generation with worst case guarantees Artificial Intelligence. 111: 209-238. DOI: 10.1016/S0004-3702(99)00036-3 |
0.691 |
|
| 1997 |
Sandholm TW, Lesser VR. Coalitions among computationally bounded agents Artificial Intelligence. 94: 99-137. DOI: 10.1016/S0004-3702(97)00030-1 |
0.312 |
|
| Show low-probability matches. |