CABOB: A fast optimal algorithm for combinatorial auctions

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

Documents Related by Co-Citation

519 Improved algorithms for optimal winner determination in combinatorial auctions and generalizations – Tuomas Sandholm, Subhash Suri - 2000
271 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
248 Bidding and Allocation in Combinatorial Auctions – Noam Nisan - 2000
585 Incentives in teams – T Groves - 1973
710 Multipart pricing of public goods – E Clarke - 1971
180 Iterative Combinatorial Auctions: Theory and Practice – David C. Parkes, Lyle H. Ungar - 2000
1222 Counter-Speculation, Auctions and Competitive Sealed Tenders – W Vickrey - 1981
111 iBundle: An Efficient Ascending Price Bundle Auction – David Parkes - 1999