Algorithm Design
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
Proceedings of the 8th ACM conference on Electronic commerce
Mixed multi-unit combinatorial auctions for supply chain management
ACM SIGecom Exchanges
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Combinatorial auctions with structured item graphs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Decentralized supply chain formation: a market protocol and competitive equilibrium analysis
Journal of Artificial Intelligence Research
Bidding languages and winner determination for mixed multi-unit combinatorial auctions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Time constraints in mixed multi-unit combinatorial auctions
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Empirical hardness for mixed auctions
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Scalable decentralized supply chain formation through binarized belief propagation
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
| Hi-index | 0.00 |
Mixed multi-unit combinatorial auctions (MMUCAs) are extensions of classical combinatorial auctions (CAs) where bidders trade transformations of goods rather than just sets of goods. Solving MMUCAs, i.e., determining the sequences of bids to be accepted by the auctioneer, is computationally intractable in general. However, differently from CAs, little was known about whether polynomial-time solvable classes of MMUCAs can be singled out based on constraining their characteristics. The paper precisely fills this gap, by depicting a clear picture of the "tractability frontier" for MMUCA instances under both structural and qualitative restrictions, which characterize interactions among bidders and types of bids involved in the various transformations, respectively. By analyzing these restrictions, a sharp frontier is charted based on various dichotomy results. In particular, tractability islands resulting from the investigation generalize on MMUCAs the largest class of tractable CAs emerging from the literature.