76 search results - page 4 / 16 » CABOB: A Fast Optimal Algorithm for Combinatorial Auctions |
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
SIGECOM
2003
ACM
14 years 21 days ago
2003
ACM
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
AAAI
2000
13 years 8 months ago
2000
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
AAAI
2000
13 years 8 months ago
2000
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...