Optimal clearing algorithms for multi-unit single item and multi-unit combinatorial auctions with demand/supply function bidding

Dang, V.D. and Jennings, N. R. (2003) Optimal clearing algorithms for multi-unit single item and multi-unit combinatorial auctions with demand/supply function bidding. 5th International Conference on Electronic Commerce, Pittsburgh, United States. pp. 25-30 .

Record type: Conference or Workshop Item (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.

Text

icec-viet.pdf - Other

Download (126kB)

More information

Published date: 2003

Additional Information: Event Dates: 2003

Venue - Dates: 5th International Conference on Electronic Commerce, Pittsburgh, United States, 2003-01-01

Keywords: Auctions, Winner Determination, Intelligent Agents

Organisations: Agents, Interactions & Complexity

Learn more about Agents, Interactions & Complexity research

Identifiers

Local EPrints ID: 258570

URI: http://eprints.soton.ac.uk/id/eprint/258570

PURE UUID: 24cfc343-44d1-4d5c-9dab-787b871da580

Catalogue record

Date deposited: 17 Nov 2003

Last modified: 14 Mar 2024 06:10

Export record

Share this record

Share this on Facebook Share this on Twitter Share this on Weibo

Contributors

Author: V.D. Dang

Author: N. R. Jennings

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

Library staff additional information