Preprint AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Opponents 2003 Conitzer V, Sandholm T
Conference AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Opponents 2003 • Proceedings, Twentieth International Conference on Machine Learning • 1:83-90 Conitzer V, Sandholm T
Preprint BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games 2003 Conitzer V, Sandholm T
Conference BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games 2003 • Proceedings, Twentieth International Conference on Machine Learning • 1:91-98 Conitzer V, Sandholm T
Journal Article BOB: Improved winner determination in combinatorial auctions and generalizations 2003 • Artificial Intelligence • 145(1-2):33-58 Sandholm T, Suri S
Conference Complexity of determining nonemptiness of the core 2003 • IJCAI International Joint Conference on Artificial Intelligence • 613-618 Conitzer V, Sandholm T
Conference Complexity of determining nonemptiness of the core 2003 • Proceedings of the ACM Conference on Electronic Commerce • 230-231 Conitzer V, Sandholm T
Conference Complexity results about Nash equilibria 2003 • IJCAI International Joint Conference on Artificial Intelligence • 765-771 Conitzer V, Sandholm T
Journal Article Compressing Two-Dimensional Routing Tables 2003 • Algorithmica • 35(4):287-300 Suri S, Sandholm T, Warkhede P
Conference Definition and complexity of some basic metareasoning problems 2003 • IJCAI International Joint Conference on Artificial Intelligence • 1099-1106 Conitzer V, Sandholm T
Conference Differential-revelation VCG mechanisms for combinatorial auctions 2003 196-197 Conen W, Sandholm T
Conference Differential-revelation VCG mechanisms for combinatorial auctions 2003 • Proceedings of the ACM Conference on Electronic Commerce • 196-197 Conen W, Sandholm T
Conference Generalizing preference elicitation in combinatorial auctions 2003 1014-1015 Hudson B, Sandholm T
Preprint How many candidates are needed to make elections hard to manipulate? 2003 Conitzer V, Lang J, Sandholm T
Conference How many candidates are needed to make elections hard to manipulate? 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 On polynomial-time preference elicitation with value queries 2003 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
