Interval Subset Sum and Uniform-Price Auction Clearing

  • Anshul Kothari
  • Subhash Suri
  • Yunhong Zhou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3595)

Abstract

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 [kminkmax]. 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Caprara, H., Kellerer, U.: Pferschy and D. Pisinger. Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research 123, 333–345 (2000)MathSciNetCrossRefMATHGoogle Scholar
  2. 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
  3. 3.
    Davenport, A., Kalagnanam, J., Lee, H.S.: Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand. Electronic Commerce Research 1(3), 221–238 (2001)CrossRefMATHGoogle Scholar
  4. 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
  5. 5.
    Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Operations Research 9, 849–859 (1961)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Ibarra, O., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. JACM 22, 463–468 (1975)MathSciNetCrossRefMATHGoogle Scholar
  7. 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
  8. 8.
    Kellerer, H., Mansini, R., Pferschy, U., Speranza, M.G.: An efficient fully polynomial approximation scheme for the Subset-Sum Problem. Journal of Computer and System Science 66, 349–370 (2003)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)CrossRefMATHGoogle Scholar
  10. 10.
    Kelly, F., Steinberg, R.: A combinatorial auction with multiple winners for universal services. Management Science 46, 586–596 (2000)CrossRefMATHGoogle Scholar
  11. 11.
    Kothari, D.: Parkes and S. Suri. Approximately-strategyproof and tractable multi-unit auctions. Decision Support Systems 39(1), 105–121 (2005)CrossRefGoogle Scholar
  12. 12.
    Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC, pp. 129–140 (1999)Google Scholar
  13. 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
  14. 14.
    Pekec, M.H.: Rothkopf and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science 44, 1131–1147 (1998)CrossRefMATHGoogle Scholar
  15. 15.
    Pisinger, D.: Linear time algorithms for knapsack problems with bounded weight. Journal of Algorithms 33, 1–14 (1999)MathSciNetCrossRefMATHGoogle Scholar
  16. 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. 17.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Anshul Kothari
    • 1
  • Subhash Suri
    • 1
  • Yunhong Zhou
    • 2
  1. 1.Computer Science DepartUniversity of CaliforniaSanta BarbaraUSA
  2. 2.HP LabsPalo AltoUSA

Personalised recommendations