Polynomial algorithms for clearing multi-unit single item and multi-unit combinatorial reverse auctions
| Autor: | Dang, VD, Jennings, NR |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2002 |
| Předmět: | |
| Zdroj: | 15th European Conf. on AI (ECAI-2002) |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|