Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
| Autor: | Ottens, B., Endriss, U., Padgham, L., Parkes, D., Müller, J., Parsons, S. |
|---|---|
| Přispěvatelé: | Logic and Computation (ILLC, FNWI/FGw) |
| Rok vydání: | 2008 |
| Předmět: | |
| Zdroj: | AAMAS 2008: 7th International Conference on Autonomous Agents and Multi-Agent Systems: Proceedings: Volume 3, 1601-1604 STARTPAGE=1601;ENDPAGE=1604;TITLE=AAMAS 2008: 7th International Conference on Autonomous Agents and Multi-Agent Systems: Proceedings: Volume 3 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|