94 search results - page 2 / 19 » An Algorithm for Multi-Unit Combinatorial Auctions |
Publication
Abstract: The current art in optimal combinatorial auctions is limited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (singl...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high ...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner deter...
CAEPIA
2009
Springer
13 years 6 months ago
2009
Springer
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, little is known about the fac...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...