A Knapsack Secretary Problem with Applications

  • Moshe Babaioff
  • Nicole Immorlica
  • David Kempe
  • Robert Kleinberg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4627)

Abstract

We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to maximize the total value. Such situations arise in many contexts, e.g., hiring workers, scheduling jobs, and bidding in sponsored search auctions.

This problem, often called the online knapsack problem, is known to be inapproximable. Therefore, we make the enabling assumption that elements arrive in a random order. Hence our problem can be thought of as a weighted version of the classical secretary problem, which we call the knapsack secretary problem. Using the random-order assumption, we design a constant-competitive algorithm for arbitrary weights and values, as well as a e-competitive algorithm for the special case when all weights are equal (i.e., the multiple-choice secretary problem). In contrast to previous work on online knapsack problems, we do not assume any knowledge regarding the distribution of weights and values beyond the fact that the order is random.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aggarwal, G., Hartline, J.: Knapsack auctions. In: SODA, pp. 1083–1092 (2006)Google Scholar
  2. 2.
    Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA, pp. 434–443 (2007)Google Scholar
  3. 3.
    Borgs, C., Chayes, J., Etesami, O., Immorlica, N., Jain, K., Mahdian, M.: Dynamics of bid optimization in online advertisement auctions. In: Proceedings of the 16th International World Wide Web Conference, (to appear, 2007)Google Scholar
  4. 4.
    Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing problems. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, Springer, Heidelberg (2005)Google Scholar
  5. 5.
    Buchbinder, N., Naor, J.: Improved bounds for online routing and packing via a primal-dual approach. In: FOCS (2006)Google Scholar
  6. 6.
    Chakrabarty, D., Zhou, Y., Lukose, R.: Budget constrained bidding in keyword auctions and online knapsack problems. In: WWW 2007, Workshop on Sponsored Search Auctions (2007)Google Scholar
  7. 7.
    Dean, B., Goemans, M., Vondrák, J.: Approximating the stochastic knapsack problem: The benefit of adaptivity. In: FOCS, pp. 208–217 (2004)Google Scholar
  8. 8.
    Dean, B., Goemans, M., Vondrák, J.: Adaptivity and approximation for stochastic packing problems. In: SODA, pp. 395–404 (2005)Google Scholar
  9. 9.
    Dynkin, E.B.: The optimum choice of the instant for stopping a Markov process. Sov. Math. Dokl. 4 (1963)Google Scholar
  10. 10.
    Feldman, J., Muthukrishnan, S., Pal, M., Stein, C.: Budget optimization in search-based advertising auctions. In: Proceedings of the 8th ACM Conference on Electronic Commerce (to appear)Google Scholar
  11. 11.
    Kleinberg, R.: A multiple-choice secretary problem with applications to online auctions. In: SODA, pp. 630–631 (2005)Google Scholar
  12. 12.
    Lueker, G.: Average-case analysis of off-line and on-line knapsack problems. In: SODA, pp. 179–188 (1995)Google Scholar
  13. 13.
    Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Mathematical Programming 68, 73–104 (1995)MathSciNetMATHGoogle Scholar
  14. 14.
    Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)CrossRefMATHGoogle Scholar
  15. 15.
    Muthukrishnan, S., Pal, M., Svitkina, Z.: Stochastic models for budget optimization in search-based (manuscript, 2007)Google Scholar
  16. 16.
    Rusmevichientong, P., Williamson, D.P.: An adaptive algorithm for selecting profitable keywords for search-based advertising services. In: Proceedings of the 7th ACM Conference on Electronic Commerce, ACM Press, New York (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Moshe Babaioff
    • 1
  • Nicole Immorlica
    • 2
  • David Kempe
    • 3
  • Robert Kleinberg
    • 4
  1. 1.UC Berkeley School of InformationUSA
  2. 2.Microsoft ResearchUSA
  3. 3.University of Southern California, Department of Computer ScienceUSA
  4. 4.Cornell University, Department of Computer ScienceUSA

Personalised recommendations