The University of Southampton
University of Southampton Institutional Repository

Polynomial algorithms for clearing multi-unit single item and multi-unit combinatorial reverse auctions

Polynomial algorithms for clearing multi-unit single item and multi-unit combinatorial reverse auctions
Polynomial algorithms for clearing multi-unit single item and multi-unit combinatorial reverse auctions
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.
23-27
Dang, V. D.
5215eda3-55fe-4f4b-8eec-e97f54260db2
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Dang, V. D.
5215eda3-55fe-4f4b-8eec-e97f54260db2
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Dang, V. D. and Jennings, N. R. (2002) Polynomial algorithms for clearing multi-unit single item and multi-unit combinatorial reverse auctions. 15th European Conf. on AI (ECAI-2002), Lyon, France. pp. 23-27 .

Record type: Conference or Workshop Item (Paper)

Abstract

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.

Text
ecai02-viet.pdf - Other
Download (91kB)

More information

Published date: 2002
Venue - Dates: 15th European Conf. on AI (ECAI-2002), Lyon, France, 2002-01-01
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 256868
URI: http://eprints.soton.ac.uk/id/eprint/256868
PURE UUID: e1b584c5-f9e1-40bf-9928-b807fde3e8fa

Catalogue record

Date deposited: 13 Jun 2003
Last modified: 23 Jun 2020 16:49

Export record

Contributors

Author: V. D. Dang
Author: N. R. Jennings

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×