A QPTAS for Open image in new window-Envy-Free Profit-Maximizing Pricing on Line Graphs

  • Khaled Elbassioni
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7392)


We consider the problem of pricing edges of a line graph so as to maximize the profit made from selling intervals to single-minded customers. An instance is given by a set E of n edges with a limited supply for each edge, and a set of m clients, where each client j specifies one interval of E she is interested in and a budget B j which is the maximum price she is willing to pay for that interval. An envy-free pricing is one in which every customer is allocated (possibly empty) interval maximizing her utility. Recently, Grandoni and Rothvoss (SODA 2011) gave a polynomial-time approximation scheme (PTAS) for the unlimited supply case with running time Open image in new window . By utilizing the known hierarchical decomposition of doubling metrics, we give a PTAS with running time Open image in new window . We then consider the limited supply case, and the notion of Open image in new window -envy-free pricing in which a customer gets an allocation maximizing her utility within an additive error of Open image in new window . For this case we develop an approximation scheme with running time Open image in new window , where \(H_e=\frac{B_{\max}(e)}{B_{\min}(e)}\) is the maximum ratio of the budgets of any two customers demanding edge e. This yields a PTAS in the uniform budget case, and a quasi-PTAS for the general case.


Dynamic Programming Line Graph Limited Supply Price Problem Combinatorial Auction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AH06]
    Aggarwal, G., Hartline, J.D.: Knapsack auctions. In: SODA, pp. 1083–1092 (2006)Google Scholar
  2. [BB06]
    Balcan, M.F., Blum, A.: Approximation algorithms and online mechanisms for item pricing. In: EC, New York, NY, USA, pp. 29–35 (2006)Google Scholar
  3. [BCES06]
    Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A quasi-PTAS for unsplittable flow on line graphs. In: STOC, pp. 721–729 (2006)Google Scholar
  4. [BK06]
    Briest, P., Krysta, P.: Single-minded unlimited supply pricing on sparse instances. In: SODA, pp. 1093–1102 (2006)Google Scholar
  5. [BK07]
    Briest, P., Krysta, P.: Buying cheap is expensive: Hardness of non-parametric multi-product pricing. In: SODA, pp. 716–725 (2007)Google Scholar
  6. [Bri08]
    Briest, P.: Uniform Budgets and the Envy-Free Pricing Problem. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 808–819. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. [CS08]
    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. [DFHS06]
    Demaine, E.D., Feige, U., Hajiaghayi, M.T., Salavatipour, M.R.: Combination can be hard: approximability of the unique coverage problem. In: SODA, pp. 162–171 (2006)Google Scholar
  9. [ERRS09]
    Elbassioni, K., Raman, R., Ray, S., Sitters, R.: On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 275–286. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  10. [ESZ07]
    Elbassioni, K., Sitters, R., Zhang, Y.: A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 451–462. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. [GHK+05]
    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. [GHK+06]
    Goldberg, A.V., Hartline, J.D., Karlin, A.R., Saks, M., Wright, A.: Competitive auctions. Games and Economic Behavior 55(2), 242–269 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  13. [GR11]
    Grandoni, F., Rothvoss, T.: Pricing on paths: A ptas for the highway problem. In: SODA, pp. 675–684 (2011)Google Scholar
  14. [GS10]
    Gamzu, I., Segev, D.: A Sublogarithmic Approximation for Highway and Tollbooth Pricing. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part I. LNCS, vol. 6198, pp. 582–593. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  15. [GvLSU06]
    Grigoriev, A., van Loon, J., Sitters, R., 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
  16. [GVR06]
    Glynn, P.W., Van Roy, B., Rusmevichientong, P.: A nonparametric approach to multi-product pricing. Operations Research 54(1), 82–98 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  17. [Tal04]
    Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: STOC, pp. 281–290 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Khaled Elbassioni

    There are no affiliations available

    Personalised recommendations