Interval Subset Sum and Uniform-Price Auction Clearing
- 1.3k Downloads
We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of integers, at most one from each interval, whose sum best approximates a target integer T. For the cardinality constrained interval subset-sum problem (kISSP), at least kmin and at most kmax integers must be selected. Our main result is a fully polynomial time approximation scheme for ISSP, with time and space both O(n . 1/ε). For kISSP, we present a 2-approximation with time O(n), and a FPTAS with time O( n . kmax . 1/ε ).
Our work is motivated by auction clearing for uniform-price multi-unit auctions, which are increasingly used by security firms to allocate IPO shares, by governments to sell treasury bills, and by corporations to procure a large quantity of goods. These auctions use the uniform price rule – the bids are used to determine who wins, but all winning bidders receive the same price. For procurement auctions, a firm may even limit the number of winning suppliers to the range [kmin, kmax]. We reduce the auction clearing problem to ISSP, and use approximation schemes for ISSP to solve the original problem. The cardinality constrained auction clearing problem is reduced to kISSP and solved accordingly.
KeywordsKnapsack Problem Combinatorial Auction Price Rule Polynomial Time Approximation Scheme Cardinality Constraint
Unable to display preview. Download preview PDF.
- 2.Dailianas, A., Sairamesh, J., Gottemukkala, V., Jhingran, A.: Profit-driven matching in e-marketplaces: Trading composable commodities. In: Agent Mediated Electronic Commerce Workshop, pp. 153–179 (1999)Google Scholar
- 4.Eso, M., et al.: Bid evaluation in procurement auctions with piece-wise linear supply curves. Technical Report RC 22219, IBM Research (2001)Google Scholar
- 7.Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, vol. 43, pp. 85–103 (1972)Google Scholar
- 12.Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC, pp. 129–140 (1999)Google Scholar
- 13.O’Callaghan, L.I., Lehmann, D., Shoham, Y.: Truth revelation in rapid, approximately efficient combinatorial auctions. In: Proc. of ACM EC, pp. 96–102 (1999)Google Scholar
- 16.Wellman, M.P., Walsh, W.E., Ygge, F.: Combinatorial auctions for supply chain formation. In: Proc. of ACM EC, pp. 260–269 (2000)Google Scholar
- 17.Google IPO Prospectus, https://www.ipo.google.com/data/prospectus.html