Conference Mixed-integer programming methods for finding Nash equilibria 2005 • Proceedings of the National Conference on Artificial Intelligence • 2:495-501 Sandholm T, Gilpin A, Conitzer V
Conference Optimal Rhode Island Hold'em poker 2005 • Proceedings of the National Conference on Artificial Intelligence • 4:1684-1685 Gilpin A, Sandholm T
Conference Policy administration control and delegation using XACML and Delegent 2005 • Proceedings - IEEE/ACM International Workshop on Grid Computing • 49-54 Seitz L, Rissanen E, Sandholm T, Firozabadi BS, Mulmo O
Conference Revenue failures and collusion in combinatorial auctions and exchanges with VCG payments 2005 • Lecture Notes in Computer Science • 3435:1-14 Conitzer V, Sandholm T
Conference Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation<sup>?</sup> 2005 • Dagstuhl Seminar Proceedings • 5011: Sandholm T, Gilpin A
Conference Spiteful Bidding in Sealed-Bid Auctions 2005 • Dagstuhl Seminar Proceedings • 5011: Brandt F, Sandholm T, Shoham Y
Conference Unconditional privacy in social choice 2005 • Proceedings of the Tenth Conference on the Theoretical Aspects of Rationality and Knowledge • 207-218 Brandt F, Sandholm T
Conference (Im)possibility of unconditionally privacy-preserving auctions 2004 • Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 • 2:810-817 Brandt F, Sandholm T
Conference An algorithm for automatically designing deterministic mechanisms without payments 2004 • Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 • 1:128-135 Conitzer V, Sandholm T
Conference An OGSA-based accounting system for allocation enforcement across HPC centers 2004 279-288 Sandholm T, Gardfjäll P, Elmroth E, Johnsson L, Mulmo O
Conference Anonymous pricing of efficient allocations in combinatorial economies 2004 • Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 • 1:254-260 Conen W, Sandholm T
Conference Combinatorial auctions with structured item graphs 2004 • Proceedings of the National Conference on Artificial Intelligence • 212-218 Conitzer V, Derryberry J, Sandholm T
Conference Communication complexity as a lower bound for learning in games 2004 24 Conitzer V, Sandholm T
Conference Communication complexity as a lower bound for learning in games 2004 • Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004 • 185-192 Conitzer V, Sandholm T
Conference Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains 2004 • Proceedings of the National Conference on Artificial Intelligence • 219-225 Conitzer V, Sandholm T
Conference Effectiveness of query types and policies for preference elicitation in combinatorial auctions 2004 • Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 • 1:386-393 Hudson B, Sandholm T
Conference Eliciting bid taker non-price preferences in (combinatorial) auctions 2004 • Proceedings of the National Conference on Artificial Intelligence • 204-211 Boutilier C, Sandholm T, Shields R
Conference Experiments on deliberation equilibria in auctions 2004 • Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 • 1:394-401 Larson K, Sandholm T
Conference Learning near-Pareto-optimal conventions in polynomial time 2004 • Advances in Neural Information Processing Systems Wang X, Sandholm T
Conference Mechanism for Optimally Trading Off Revenue and Efficiency in Multi-unit Auctions 2004 • Lecture Notes in Computer Science • 3048:92-108 Likhodedov A, Sandholm T
