CABOB: A fast optimal algorithm for combinatorial auctions

by Tuomas Sandholm , Subhash Suri , Andrew Gilpin , David Levine
Citations:122 - 26 self

Documents Related by Co-Citation

519 Improved algorithms for optimal winner determination in combinatorial auctions and generalizations – Tuomas Sandholm, Subhash Suri - 2000
267 Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches – Yuzo Fujishima, Kevin Leyton-brown, Yoav Shoham - 1999
314 Computationally Manageable Combinatorial Auctions – Michael H. Rothkopf, Aleksandar Pekec, Ronald M. Harstad - 1998
242 Bidding and Allocation in Combinatorial Auctions – Noam Nisan - 2000
711 Multipart pricing of public goods – E H Clarke - 1971
580 Incentives in teams – T Groves - 1973
178 Iterative Combinatorial Auctions: Theory and Practice – David C. Parkes, Lyle H. Ungar - 2000
106 eMediator: A Next Generation Electronic Commerce Server – Tuomas Sandholm - 2002
77 Truth Revelation in Rapid, Approximately Efficient Combinatorial Auctions – Daniel Lehmann, Liadan Ita O'callaghan, Yoav Shoham - 1999
1210 Counterspeculation, auctions, and competitive sealed tender – W Vickrey - 1961
110 iBundle: An Efficient Ascending Price Bundle Auction – David Parkes - 1999
91 Integer programming for combinatorial auction winner determination – Arne Andersson, Mattias Tenhunen, Fredrik Ygge - 2000
188 Computationally feasible VCG mechanisms – Noam Nisan, Amir Ronen - 2000
157 Winner determination in combinatorial auction generalizations – Tuomas Sandholm - 2002
62 Optimal Auction Design for Agents with Hard Valuation Problems – David C. Parkes - 1999
56 Issues in computational Vickrey auction – Tuomas Sandholm - 2000
50 Linear Programming and Vickrey Auctions – Sushil Bikhchandani, Sven de Vries, James Schummer, Rakesh V. Vohra - 2001
89 The nonatomic assignment model – N E Gretsky, J M Ostroy, W R Zame - 1992
50 Fredrik Ygge. Integer programming for combinatorial auction winner determination – Arne Andersson, Mattias Tenhunen - 2000