Journal Article Scalable Grid‐wide capacity allocation with the SweGrid Accounting System (SGAS) 2008 • Concurrency Computation Practice and Experience • 20(18):2089-2122 Gardfjäll P, Elmroth E, Johnsson L, Mulmo O, Sandholm T
Conference Solving two-person zero-sum repeated games of incomplete information 2008 • Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS • 2:885-892 Gilpin A, Sandholm T
Journal Article THE NEVER-ENDING ALTRUISTIC DONOR 2008 • Transplantation • 86(2S):183 Rees M, Kopke J, Hil G, Reitsma W, Pelletier R, Rogers J, Sandholm T, Roth A, Unver U, Montgomery R
Conference 07431 Executive Summary Computational Issues in Social Choice - Dagstuhl Seminar - 2007 • Dagstuhl Seminar Proceedings • 7431: Endriss U, Lang J, Rossi F, Sandholm T
Conference A statistical approach to risk mitigation in computational markets 2007 85-96 Sandholm T, Lai K
Conference Automated Design of Multistage Mechanisms 2007 • IJCAI International Joint Conference on Artificial Intelligence • 1500-1506 Sandholm T, Conitzer V, Boutilier C
Conference Automated online mechanism design and prophet inequalities 2007 • Proceedings of the National Conference on Artificial Intelligence • 1:58-65 Hajiaghayi MT, Kleinberg R, Sandholm T
Journal Article AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents 2007 • Machine Learning • 67(1-2):23-43 Conitzer V, Sandholm T
Conference Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker 2007 1-8 Gilpin A, Sandholm T
Conference Clearing algorithms for barter exchange markets 2007 295-304 Abraham DJ, Blum A, Sandholm T
Conference Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions 2007 • Lecture Notes in Computer Science • 4508:426-426 Sandholm T
Conference Expressive Commerce and Its Application to Sourcing: How We Conducted $35 Billion of Generalized Combinatorial Auctions 2007 • AI Magazine • 28(3):45-45 Sandholm T
Conference Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games 2007 • Lecture Notes in Computer Science • 4858:57-69 Gilpin A, Hoda S, Peña J, Sandholm T
Conference Incremental Mechanism Design 2007 • IJCAI International Joint Conference on Artificial Intelligence • 1251-1256 Conitzer V, Sandholm T
Conference Information-theoretic approaches to branching in search 2007 • IJCAI International Joint Conference on Artificial Intelligence • 2286-2292 Gilpin A, Sandholm T
Journal Article Lossless abstraction of imperfect information games 2007 • Journal of the ACM • 54(5):25-es Gilpin A, Sandholm T
Journal Article Perspectives on multiagent learning 2007 • Artificial Intelligence • 171(7):382-391 Sandholm T
Conference Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold'em poker 2007 • Proceedings of the National Conference on Artificial Intelligence • 1:50-57 Gilpin A, Sandholm T, Sørensen TB
Conference Prediction-Based Enforcement of Performance Contracts 2007 • Lecture Notes in Computer Science • 4685:71-82 Sandholm T, Lai K
Conference Spiteful bidding in sealed-bid auctions 2007 • IJCAI International Joint Conference on Artificial Intelligence • 1207-1214 Brandt F, Sandholm T, Shoham Y
Journal Article When are elections with few candidates hard to manipulate? 2007 • Journal of the ACM • 54(3): Conitzer V, Sandholm T, Lang J
Conference A compact representation scheme for coalitional games in open anonymous environments 2006 • Proceedings of the National Conference on Artificial Intelligence • 1:697-702 Ohta N, Iwasaki A, Yokoo M, Maruono K, Conitzer V, Sandholm T
Conference A competitive Texas Hold'em poker player via automated abstraction and real-time equilibrium computation 2006 • Proceedings of the National Conference on Artificial Intelligence • 2:1007-1013 Gilpin A, Sandholm T
Conference A new solution concept for coalitional games in open anonymous environments 2006 • Lecture Notes in Computer Science • 4012:53-64 Yokoo M, Conitzer V, Sandholm T, Ohta N, Iwasaki A
