An O(n) algorithm for the linear multiple choice knapsack problem and related problems
Information Processing Letters
Information Processing Letters
Computationally Manageable Combinational Auctions
Management Science
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Truth revelation in approximately efficient combinatorial auctions
Proceedings of the 1st ACM conference on Electronic commerce
Combinatorial auctions for supply chain formation
Proceedings of the 2nd ACM conference on Electronic commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Electronic Commerce Research
Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
ICEC '03 Proceedings of the 5th international conference on Electronic commerce
A Combinatorial Auction with Multiple Winners for Universal Service
Management Science
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Approximately-strategyproof and tractable multiunit auctions
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Interval subset sum and uniform-price auction clearing
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
AAMAS'04 Proceedings of the 6th AAMAS international conference on Agent-Mediated Electronic Commerce: theories for and Engineering of Distributed Mechanisms and Systems
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Theoretical Computer Science
On the admission of dependent flows in powerful sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We study the interval knapsack problem (I-KP), and the interval multiple-choice knapsack problem (I-MCKP), as generalizations of the classic 0/1 knapsack problem (KP) and the multiple-choice knapsack problem (MCKP), respectively. Compared to singleton items in KP and MCKP, each item i in I-KP and I-MCKP is represented by a ([ai , bi], pi) pair, where integer interval [ai, bi] specifies the possible range of units, and pi is the unit-price. Our main results are a FPTAS for I-KP with time O(n logn + n/ε2) and a FPTAS for I-MCKP with time O(nm /ε), and pseudo-polynomial-time algorithms for both I-KP and I-MCKP with time O(nM) and space O(n + M). Here n, m, and M denote number of items, number of item sets, and knapsack capacity respectively. We also present a 2-approximation of I-KP and a 3-approximation of I-MCKP both in linear time. We apply I-KP and I-MCKP to the single-good multi-unit sealed-bid auction clearing problem where M identical units of a single good are auctioned. We focus on two bidding models, among them the interval model allows each bid to specify an interval range of units, and XOR-interval model allows a bidder to specify a set of mutually exclusive interval bids. The interval and XOR-interval bidding models correspond to I-KP and I-MCKP respectively, thus are solved accordingly. We also show how to compute VCG payments to all the bidders with an overhead of O(logn) factor. Our results for XOR-interval bidding model imply improved algorithms for the piecewise constant bidding model studied by Kothari et al. [18], improving their algorithms by a factor of Ω(n).