Openly accessible

A winner determination algorithm for multi-unit combinatorial auctions with reserve prices

Bai, H. and Zhang, Zili 2005, A winner determination algorithm for multi-unit combinatorial auctions with reserve prices, in Proceedings of the 2005 International Conference on Active Media Technology : (AMT2005) : May 19-21, 2005, Kagawa International Conference Hall, Takamatsu, Kagawa, Japan, IEEE Xplore, Piscataway, N.J., pp. 239-243.

Attached Files
Name Description MIMEType Size Downloads
zhang-awinnerdetermination-2005.pdf Published version application/pdf 837.02KB 38

Title A winner determination algorithm for multi-unit combinatorial auctions with reserve prices
Author(s) Bai, H.
Zhang, Zili
Conference name International Conference on Active Media Technology (3rd : 2005 : Kagawa-gun, Japan)
Conference location Kagawa, Japan
Conference dates 19-21 May 2005
Title of proceedings Proceedings of the 2005 International Conference on Active Media Technology : (AMT2005) : May 19-21, 2005, Kagawa International Conference Hall, Takamatsu, Kagawa, Japan
Editor(s) Tarumi, H.
Li, Y.
Yoshida, T.
Publication date 2005
Conference series Active Media Technology Conference
Start page 239
End page 243
Publisher IEEE Xplore
Place of publication Piscataway, N.J.
Keyword(s) multi-agent systems
combinatorial auction
multi-unit combinatorial auction
reserve price
winner determination problem
Summary Combinatorial auction mechanisms have been used in many applications such as resource and task allocation, planning and time scheduling in multi-agent systems, in which the items to be allocated are complementary or substitutable. The winner determination in combinatorial auction itself is a NP-complete problem, and has attracted many attentions of researchers world wide. Some outstanding achievements have been made including CPLEX and CABOB algorithms on this topic. To our knowledge, the research into multi-unit combinatorial auctions with reserve prices considered is more or less ignored. To this end, we present a new algorithm for multi-unit combinatorial auctions with reserve prices, which is based on Sandholm's work. An efficient heuristic function is developed for the new algorithm. Experiments have been conducted. The experimental results show that auctioneer agent can find the optimal solution efficiently for a reasonable problem scale with our algorithm.
Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ISBN 0780390350
9780780390355
Language eng
Field of Research 080105 Expert Systems
HERDC Research category E1 Full written paper - refereed
Copyright notice ©2005, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30009697

Document type: Conference Paper
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Access Statistics: 465 Abstract Views, 38 File Downloads  -  Detailed Statistics
Created: Tue, 14 Oct 2008, 07:01:13 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.