PP-2008-13: Comparing Winner Determination Algorithms for Mixed Multi-unit Combinatorial Auctions

PP-2008-13: Ottens, Brammert and Endriss, Ulle (2008) Comparing Winner Determination Algorithms for Mixed Multi-unit Combinatorial Auctions. [Report]

Text (Full Text)

Download (156kB) | Preview
[img] Text (Abstract)

Download (1kB)


Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposing a transformation a bidder is offering to produce a certain set of output goods after having received the specified input goods. Solving such a mixed auction means choosing a sequence of transformations such that the auctioneer ends up with all the goods desired at the lowest possible cost. This is a generalisation of the winner determination problem in combinatorial auctions and cannot be solved using standard winner determination algorithms. In this paper we analyse the computational complexity of the winner determination problem for mixed auctions and compare the performance of two new algorithms and of the original algorithm proposed for the problem. We also discuss suitable ways of generating test sets for this comparison.

Item Type: Report
Report Nr: PP-2008-13
Series Name: Prepublication (PP) Series
Year: 2008
Uncontrolled Keywords: combinatorial auctions; integer programming
Depositing User: Ulle Endriss
Date Deposited: 12 Oct 2016 14:36
Last Modified: 12 Oct 2016 14:36
URI: https://eprints.illc.uva.nl/id/eprint/287

Actions (login required)

View Item View Item