By Topic

The computational complexity of dynamic programming algorithm for combinatorial auctions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shan-Li Hu ; Dept. of Comput. Sci., Fuzhou Univ., China ; Chun-yi Shi

Auctions are important mechanisms for resource and task allocation in multi-agent systems. Combinatorial auctions where bidders can bid on bundles of items can lead to more economical revenue. This is a winner determination problem. But determining the winners is NP-complete. Rothkopf et al. (1998) presented a dynamic programming algorithm for this problem. It is an optimal algorithm found so far for the general case. In this paper we analyze its computational complexity exactly, prove that the computational complexity of the algorithm is Θ(3n) for n items. Compared with the result O(3n) of Rothkopf et al., it is more exact. This will help research on the approximate algorithm for the winner determination problem in combinatorial auctions, and for the optimal coalition structure generation in multi-agent systems.

Published in:

Machine Learning and Cybernetics, 2002. Proceedings. 2002 International Conference on  (Volume:1 )

Date of Conference: