The computational complexity of dynamic programming algorithm for combinatorial auctions

被引：0
|
作者：
Hu, SL [1 ]
Shi, CY [1 ]
机构：
[1] Fuzhou Univ, Dept Comp Sci & Technol, Fuzhou 350002, Peoples R China
来源：
2002 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-4, PROCEEDINGS | 2002年
关键词：
combinatorial auctions; dynamic programming; computational complexity;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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 presented a dynamic programming algorithm for this problem. It is an optimal algorithm found so far for the general case. In this paper we analyzes its computational complexity exactly, prove that the computational complexity of the algorithm is Theta(3(n)) for n items. Comparing with the result O(3(n)) of Rothkopf et al, it is more exact. This will help to research on the approximate algorithm for the winner determination problem in combinatorial auctions, and for the optimal coalition structure generation in multi-agent systems.
引用
收藏
页码：266 / 268
页数：3
相关论文
共 50 条
  • [21] Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps
    Doecker, Janosch
    Dorn, Britta
    Endriss, Ulle
    Krueger, Dominikus
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 802 - 809
  • [22] Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers
    Ezra, Tomer
    Feldman, Michal
    Neyman, Eric
    Talgam-Cohen, Inbal
    Weinberg, Matt
    2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 249 - 272
  • [23] Combinatorial auctions, an example of algorithm theory in real life
    Andersson, Arne
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2003, 2598 : 13 - 21
  • [24] A Genetic Algorithm for the Winner Determination Problem in Combinatorial Auctions
    Uzunbayir, Serhat
    2018 3RD INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK), 2018, : 127 - 132
  • [25] A Faster Core Constraint Generation Algorithm for Combinatorial Auctions
    Bunz, Benedikt
    Seuken, Sven
    Lubin, Benjamin
    PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 827 - 834
  • [26] An approximate algorithm for resource allocation using combinatorial auctions
    Avasarala, Viswanath
    Polavarapu, Himanshu
    Mullen, Tracy
    2006 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY, PROCEEDINGS, 2006, : 571 - +
  • [27] Combinatorial auctions, an example of algorithm theory in real life
    Andersson, A
    COMPUTER SCIENCE IN PERSPECTIVE: ESSAYS DEDICATED TO THOMAS OTTMANN, 2003, 2598 : 13 - 21
  • [28] An efficient approximate algorithm for winner determination in combinatorial auctions
    Sakurai, Yuko
    Yokoo, Makoto
    Kamei, Koji
    Transactions of the Japanese Society for Artificial Intelligence, 2001, 16 (05) : 445 - 453
  • [29] An Improved Approximation Algorithm for Combinatorial Auctions with Submodular Bidders
    Dobzinski, Shahar
    Schapira, Michael
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 1064 - 1073
  • [30] Hybrid Algorithm for Winner Determination Problem in Combinatorial Auctions
    Chen, Li
    Chen, Xiaoyun
    Hu, Shanli
    Lin, Yunguo
    2008 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, VOLS 1 AND 2, PROCEEDINGS, 2008, : 645 - +
12345