Dear Spiral user, We’re pleased to introduce Helix, https://helix.imperial.ac.uk/ Imperial’s new repository for research datasets. Please use Helix for all future dataset deposits. There is no change to Spiral -continue depositing as usual. For queries, contact the Research Data Management team at rdm-enquiries@imperial.ac.uk. Kind regards, the Spiral Team.
 
Optimal clearing algorithms for multi-unit single item and multi-unit combinatorial auctions with demand/supply function bidding
OA Location
Author(s)
Dang, VD
Jennings, NR
Type
Conference Paper
Abstract
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexity of our algorithms and prove that they are guaranteed to find the optimal allocation.
Date Issued
2003
Citation
2003, pp.25-30
URI
URL
Start Page
25
End Page
30
Identifier
http://eprints.soton.ac.uk/258570/
Source
5th International Conference on Electronic Commerce
Notes
Event Dates: 2003 keywords: Auctions, Winner Determination, Intelligent Agents
Publication Status
Unpublished