Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply

  • Khaled Elbassioni
  • Mahmoud Fouz
  • Chaitanya Swamy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6484)

Abstract

We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the approximability of the profit-maximization problem to that of the corresponding social-welfare-maximization (SWM) problem, which is the problem of finding an allocation (S1,...,Sn) satisfying the capacity constraints that has maximum total value ∑ jvj(Sj). Our results apply to both structured valuation classes, such as subadditive valuations, as well as arbitrary valuations. For subadditive valuations (and hence submodular, XOS valuations), we obtain a solution with profit Open image in new window, where Open image in new window is the optimum social welfare and c max is the maximum item-supply; thus, this yields an O(logc max )-approximation for the profit-maximization problem. Furthermore, given any class of valuation functions, if the SWM problem for this valuation class has an LP-relaxation (of a certain form) and an algorithm “verifying” an integrality gap of α for this LP, then we obtain a solution with profit Open image in new window, thus obtaining an O(α\log c_{\max})-approximation. The latter result implies an \(O(\sqrt m\log c_{\max})\)-approximation for the profit maximization problem for combinatorial auctions with arbitrary valuations, and an O(logc max )-approximation for the non-single-minded tollbooth problem on trees. For the special case, when the tree is a path, we also obtain an incomparable O(logm)-approximation (via a different approach) for subadditive valuations, and arbitrary valuations with unlimited supply.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aggarwal, G., Feder, T., Motwani, R., Zhu, A.: Algorithms for multi-product pricing. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 72–83. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  2. 2.
    Aggarwal, G., Hartline, J.D.: Knapsack auctions. In: SODA, pp. 1083–1092 (2006)Google Scholar
  3. 3.
    Balcan, M.F., Blum, A., Mansour, Y.: Item pricing for revenue maximization. In: EC, pp. 50–59 (2008)Google Scholar
  4. 4.
    Briest, P., Krysta, P.: Single-minded unlimited supply pricing on sparse instances. In: SODA, pp. 1093–1102 (2006)Google Scholar
  5. 5.
    Carr, R., Vempala, S.: Randomized metarounding. Random Structures and Algorithms 20(3), 343–352 (2002)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. Algorithmica 47 (2007)Google Scholar
  7. 7.
    Cheung, M., Swamy, C.: Approximation algorithms for single-minded envy-free profit-maximization problems with limited supply. In: FOCS, pp. 35–44 (2008)Google Scholar
  8. 8.
    Dobzinski, S., Schapira, M.: An improved approximation algorithm for combinatorial auctions with submodular bidders. In: SODA, pp. 1064–1073 (2006)Google Scholar
  9. 9.
    Feige, U.: On maximizing welfare when utility functions are subadditive. In: STOC, pp. 41–50 (2006)Google Scholar
  10. 10.
    Grigoriev, A., van Loon, J., Sitters, R.A., Uetz, M.: How to sell a graph: Guidelines for graph retailers. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 125–136. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: SODA, pp. 1164–1173 (2005)Google Scholar
  12. 12.
    Kolliopoulos, S.G., Stein, C.: Approximating disjoint-path problems using packing integer programs. Math. Program. 99(1), 63–87 (2004)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. In: FOCS (2005)Google Scholar
  14. 14.
    Lehmann, B., Lehmann, D.J., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: EC, pp. 18–28 (2001)Google Scholar
  15. 15.
    Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. Syst. Sci. 37(2), 130–143 (1988)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Sivakumar, D.: Algorithmic derandomization via complexity theory. In: STOC, pp. 619–626 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Khaled Elbassioni
    • 1
  • Mahmoud Fouz
    • 2
  • Chaitanya Swamy
    • 3
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany
  2. 2.FR InformatikUniversität des SaarlandesSaarbrückenGermany
  3. 3.Dept. of Combinatorics and OptimizationUniv. WaterlooWaterloo

Personalised recommendations