Elsevier

Artificial Intelligence

Volume 196, March 2013, Pages 1-25
Artificial Intelligence

The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions

https://doi.org/10.1016/j.artint.2012.12.002Get rights and content
Under an Elsevier user license
open archive

Abstract

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 classical combinatorial auctions, little was known about whether polynomial-time solvable classes of MMUCAs can be singled out on the basis of their characteristics. The paper fills this gap, by studying the computational complexity of MMUCA instances under structural and qualitative restrictions, which characterize interactions among bidders and types of bids involved in the various transformations, respectively.

Keywords

Mixed multi-unit combinatorial auctions
Computational complexity
Structural decomposition methods

Cited by (0)