Sciweavers

44 search results - page 1 / 9
» An Efficient Approximate Algorithm for Winner Determination ...
Sort
View
AI
2002
Springer
13 years 3 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
ICMAS
2000
13 years 5 months ago
Integer Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
Arne Andersson, Mattias Tenhunen, Fredrik Ygge
AAAI
2000
13 years 5 months ago
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
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...
Tuomas Sandholm, Subhash Suri
WSC
2008
13 years 6 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese