CABOB: A fast optimal algorithm for combinatorial auctions

by Tuomas Sandholm , Subhash Suri , Andrew Gilpin , David Levine
Citations:118 - 25 self

Documents Related by Co-Citation

459 Improved algorithms for optimal winner determination in combinatorial auctions and generalizations – Tuomas Sandholm, Subhash Suri - 2000
245 Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches – Yuzo Fujishima, Kevin Leyton-brown, Yoav Shoham - 1999
218 Bidding and Allocation in Combinatorial Auctions – Noam Nisan - 2000
286 Computationally Manageable Combinatorial Auctions – Michael H. Rothkopf, Aleksandar Pekec, Ronald M. Harstad - 1998
556 Multipart pricing of public goods – E H CLARKE - 1971
441 Incentives in Teams – T GROVES - 1973
155 Iterative Combinatorial Auctions: Theory and Practice – David C. Parkes, Lyle H. Ungar - 2000
954 Counterspeculation, Auctions, and Competitive Sealed Tenders – William Vickrey - 1961
71 Truth Revelation in Rapid, Approximately Efficient Combinatorial Auctions – Daniel Lehmann, Liadan Ita O'callaghan, Yoav Shoham - 1999
103 iBundle: An Efficient Ascending Price Bundle Auction – David Parkes - 1999
99 eMediator: A Next Generation Electronic Commerce Server – Tuomas Sandholm - 2002
140 Winner determination in combinatorial auction generalizations – Tuomas Sandholm - 2002
166 Computationally Feasible VCG Mechanisms – Noam Nisan, Amir Ronen - 2000
55 Optimal Auction Design for Agents with Hard Valuation Problems – David C. Parkes - 1999
76 The package assignment model – S Bikhchandani, J Ostroy
100 The communication requirements of efficient allocations and supporting prices – Noam Nisan, Ilya Segal - 2006
81 Integer programming for combinatorial auction winner determination – Arne Andersson, Mattias Tenhunen, Fredrik Ygge - 2000
80 Solving Combinatorial Auctions using Stochastic Local Search – Holger H. Hoos, Craig Boutilier - 2000
35 Side constraints and non-price attributes in markets – Tuomas Sandholm, Subhash Suri - 2001