163 search results - page 3 / 33 » Approximate bidding algorithms for a distributed combinatori... |
AAAI
2004
13 years 8 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
WECWIS
2005
IEEE
14 years 27 days ago
2005
IEEE
Proxy bidding has been proposed for combinatorial auctions as a means to speed up the auctions, to simplify the user interface, and to limit strategic behavior. The only previousl...
ICMAS
2000
13 years 8 months ago
2000
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...
ACMICEC
2003
ACM
14 years 18 days ago
2003
ACM
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
ATAL
2004
Springer
14 years 22 days ago
2004
Springer
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...