Conference How many candidates are needed to make elections hard to manipulate? 2003 • Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2003 • 201-214 Conitzer V, Lang J, Sandholm T
Conference Making markets and democracy work: A story of incentives and computing 2003 • IJCAI International Joint Conference on Artificial Intelligence • 1649-1671 Sandholm T
Conference Miscomputing Ratio: Social Cost of Selfish Computing 2003 • Proceedings of the Interantional Conference on Autonomous Agents • 2:273-280 Larson K, Sandholm T
Conference On polynomial-time preference elicitation with value queries 2003 • Proceedings of the ACM Conference on Electronic Commerce • 176-185 Zinkevich MA, Blum A, Sandholm T
Conference Preference elicitation and query learning 2003 • Lecture Notes in Computer Science • 2777:13-25 Blum A, Jackson JC, Sandholm T, Zinkevich M
Conference Proceedings of the International Conference on Autonomous Agents: Foreword 2003 • Proceedings of the Interantional Conference on Autonomous Agents • 2: Rosenschein JS, Wooldridge M, Sandholm T, Yokoo M
Conference Reinforcement learning to play an optimal nash equilibrium in team Markov games 2003 • Advances in Neural Information Processing Systems Wang X, Sandholm T
Conference Solving combinatorial exchanges: Optimality via a few partial bids 2003 • Proceedings of the ACM Conference on Electronic Commerce • 236-237 Kothari A, Sandholm T, Suri S
Journal Article Terminating decision algorithms optimally 2003 • Lecture Notes in Computer Science • 2833:950-955 Sandholm T
Conference Universal voting protocol tweaks to make manipulation hard 2003 • IJCAI International Joint Conference on Artificial Intelligence • 781-788 Conitzer V, Sandholm T
Conference Using value queries in combinatorial auctions 2003 • Proceedings of the ACM Conference on Electronic Commerce • 226-227 Hudson B, Sandholm T
Conference (Im)possibility of safe exchange mechanism design 2002 • Proceedings of the National Conference on Artificial Intelligence • 338-344 Sandholm T, Wang XF
Journal Article Algorithm for optimal winner determination in combinatorial auctions 2002 • Artificial Intelligence • 135(1-2):1-54 Sandholm T
Conference An alternating offers bargaining model for computationally limited agents 2002 135-142 Larson K, Sandholm T
Conference An alternating offers bargaining model for computationally limited agents 2002 • Proceedings of the International Conference on Autonomous Agents • 135-142 Larson K, Sandholm T
Conference Bidders with hard valuation problems 2002 • Proceedings of the International Conference on Autonomous Agents • 160-161 Larson K, Sandholm T
Conference Complexity of manipulating elections with few candidates 2002 • Proceedings of the National Conference on Artificial Intelligence • 314-319 Conitzer V, Sandholm I
Journal Article Contracting with uncertain level of trust 2002 • Computational Intelligence • 18(4):501-514 Braynov S, Sandholm T
Conference Differential-revelation VCG mechanisms for combinatorial auctions 2002 • Lecture Notes in Computer Science • 2531:34-51 Conen W, Sandholm T
Conference Effectiveness of preference elicitation in combinatorial auctions 2002 • Lecture Notes in Computer Science • 2531:69-86 Hudson B, Sandholm T
