Sandholm, Tuomas; Suri, Subhash; Gilpin, Andrew; … - In: Management Science 51 (2005) 3, pp. 374-390
Combinatorial auctions where bidders can bid on bundles of items can lead to more economically efficient allocations, but determining the winners is \scr{N}\scr{P}-complete and inapproximable. We present CABOB, a sophisticated optimal search algorithm for the problem. It uses decomposition...