Polynomial algorithms for clearing multi-unit single item and multi-unit combinatorial reverse auctions
Dang, V. D. and Jennings, N. R. (2002) Polynomial algorithms for clearing multi-unit single item and multi-unit combinatorial reverse auctions. In, 15th European Conf. on AI (ECAI-2002), Lyon, France, , 23-27.
This paper develops new algorithms for clearing multi-unit single-item and multi-unit combinatorial reverse auctions. Specifically, we consider settings where bids are submitted in the form of a supply function and the auctions have sub-additive pricing with free disposal. Our algorithms are based on a greedy strategy and we show that they are of polynominal complexity. Furthermore, we show that the solutions they generate are within a finite bound of the optimal.
|Item Type:||Conference or Workshop Item (Paper)|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||13 Jun 2003|
|Last Modified:||16 Aug 2012 03:16|
|Contributors:||Dang, V. D. (Author)
Jennings, N. R. (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||1|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)