Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2008: Automata, Languages and Programming pp 186–197Cite as

Improved Approximation Algorithms for Budgeted Allocations

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5125))

Abstract

We provide a 3/2-approximation algorithm for an offline budgeted allocations problem with applications to sponsored search auctions. This an improvement over the e/(e − 1) approximation of Andelman and Mansour [1] and the e/(e − 1) − ε approximation (for ε ≈ 0.0001) of Feige and Vondrak [2] for the more general Maximum Submodular Welfare (SMW) problem. For a special case of our problem, we improve this ratio to \(\sqrt{2}\). We also show that the problem is APX-hard.

This research was supported by the Israeli Science Foundation, NSF Grant CCF-0635147, and by an NSF Graduate Research Fellowship.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   199.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andelman, N., Mansour, Y.: Auctions with Budget Constraints. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Feige, U., Vondrak, J.: Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. In: FOCS 2006, pp. 667–676 (2006)

    Google Scholar 

  3. Lahaie, S., Pennock, D., Saberi, A., Vohra, R.: Sponsored search auctions. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, pp. 699–716. Cambridge University Press, Cambridge (2007)

    Chapter  Google Scholar 

  4. Buchbinder, N., Jain, K., Naor, J.: Online primal-dual algorithms for maximizing ad-auctions revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 253–264. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: SODA 2008, pp. 982–991 (2008)

    Google Scholar 

  6. Mahdian, M., Nazerzadeh, H., Saberi, A.: Allocating online advertisement space with unreliable estimates. In: EC 2007, pp. 288–294 (2007)

    Google Scholar 

  7. Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM 54(5), 22 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior 55(2), 270–296 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP (manuscript, 2008)

    Google Scholar 

  10. Srinivasan, A.: Budgeted allocations in the full-information setting (manuscript, 2008)

    Google Scholar 

  11. Dobzinski, S., Schapira, M.: An improved approximation algorithm for combinatorial auctions with submodular bidders. In: SODA 2006, pp. 1064–1073 (2006)

    Google Scholar 

  12. Khot, S., Lipton, R., Markakis, E., Mehta, A.: Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 92–101. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Mirrokni, V., Schapira, M., Vondrak, J.: Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions (manuscript, 2007)

    Google Scholar 

  14. Vondrak, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: STOC 2008 (to appear, 2008)

    Google Scholar 

  15. Fleischer, L., Goemans, M., Mirrokni, V., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: SODA 2006, pp. 611–620 (2006)

    Google Scholar 

  16. Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: SODA 2000, pp. 213–222 (2000)

    Google Scholar 

  17. Shmoys, D., Tardos, E.: An approximation algorithm for the generalized assignment problem. Mathematical Programming 62, 461–474 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  18. Andelman, N.: Online and strategic aspects of network resource management algorithms. PhD thesis, Tel Aviv University (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research and Tel-Aviv University, USA

    Yossi Azar

  2. University of Washington, USA

    Benjamin Birnbaum, Anna R. Karlin & C. Thach Nguyen

  3. Brown University, USA

    Claire Mathieu

Authors
  1. Yossi Azar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benjamin Birnbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anna R. Karlin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Claire Mathieu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. C. Thach Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavík, Iceland

    Luca Aceto

  2. Department of Computer Science, IT-Parken, University of Aarhus, Åbogade 34, 8200, ÅrhusN, Denmark

    Ivan Damgård

  3. Department of Computer Science, University of Liverpool, Ashton Building, L69 3BX, Liverpool, UK

    Leslie Ann Goldberg

  4. School of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavik, Iceland

    Magnús M. Halldórsson

  5. Department of Computer Science, Reykjavik University, Kringlan 1, 103, Reykjavík, Iceland

    Anna Ingólfsdóttir

  6. Université de Bordeaux-1, LaBRI, 351, Cours de la Libération, 33405, Talence cedex, France

    Igor Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Azar, Y., Birnbaum, B., Karlin, A.R., Mathieu, C., Nguyen, C.T. (2008). Improved Approximation Algorithms for Budgeted Allocations . In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70575-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70575-8_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70574-1

  • Online ISBN: 978-3-540-70575-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation