Khaled Elbassioni
Abstract
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 specifies one interval of E she is interested in and a budget Bj 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 an (possibly empty) interval maximizing her utility. Grandoni and Rothvoss (SIAM J. Comput. 2016) proposed a polynomial-time approximation scheme (PTAS) for the unlimited supply case with running time (nm)O((1/ɛ) 1/ɛ), which was extended to the limited supply case by Grandoni and Wiese (ESA 2019). By utilizing the known hierarchical decomposition of doubling metrics, we give a PTAS with running time (nm)O(1/ ɛ2) for the unlimited supply case. We then consider the limited supply case, and the notion of ɛ-envy-free pricing in which a customer gets an allocation maximizing her utility within an additive error of ɛ. For this case, we develop an approximation scheme with running time (nm)O(log 5/2maxeHe/ɛ3), where He= Bmax(e)/Bmin(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. The best approximation known, in both cases, for the exact envy-free pricing version is O(log cmax), where cmax is the maximum item supply. Our method is based on the known hierarchical decomposition of doubling metrics, and can be applied to other problems, such as the maximum feasible subsystem problem with interval matrices.
- G. Aggarwal and J. D. Hartline. 2006. Knapsack auctions. In SODA. ACM Press, New York, NY, 1083–1092. DOI:https://doi.org/10.1145/1109557.1109677Google Scholar
- M. F. Balcan and A. Blum. 2007. Approximation algorithms and online mechanisms for item pricing. Theory of Computing 3 (2007), 179–195.Google ScholarCross Ref
- N. Bansal, A. Chakrabarti, A. Epstein, and B. Schieber. 2006. A quasi-PTAS for unsplittable flow on line graphs. In STOC. ACM Press, New York, NY, 721–729. DOI:https://doi.org/10.1145/1132516.1132617Google ScholarDigital Library
- P. Briest and P. Krysta. 2006. Single-minded unlimited supply pricing on sparse instances. In SODA. ACM Press, New York, NY, 1093–1102. DOI:https://doi.org/10.1145/1109557.1109678Google Scholar
- P. Briest and P. Krysta. 2007. Buying cheap is expensive: Hardness of non-parametric multi-product pricing. In SODA. 716–725.Google Scholar
- P. Briest. 2008. Uniform budgets and the envy-free pricing problem. In ICALP. 808–819.Google Scholar
- P. Chalermsook, J. Chuzhoy, S. Kannan, and S. Khanna. 2012. Improved hardness results for profit maximization pricing problems with unlimited supply. In Proceedings of the 15th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX 2012) and Proceedings of the 16th International Workshop on Randomization and Computation (RANDOM 2012), Lecture Notes in Computer Science, Vol. 7408. Springer, 73–84.Google Scholar
- N. Chen, A. Ghosh, and S. Vassilvitskii. 2011. Optimal envy-free pricing with metric substitutability. SIAM J. Comput. 40, 3 (2011), 623–645.Google ScholarDigital Library
- P. Chalermsook, B. Laekhanukit, and D. Nanongkai. 2013. Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnesses. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013). IEEE Computer Society, 370–379. DOI:https://doi.org/10.1109/FOCS.2013.47Google ScholarDigital Library
- M. Cheung and C. Swamy. 2008. Approximation algorithms for single-minded envy-free profit-maximization problems with limited supply. In FOCS. IEEE Computer Society, 35–44. http://dx.doi.org/10.1109/FOCS.2008.15Google ScholarDigital Library
- E. D. Demaine, U. Feige, M. T. Hajiaghayi, and M. R. Salavatipour. 2006. Combination can be hard: Approximability of the unique coverage problem. In SODA. ACM Press, New York, NY, 162–171. DOI:https://doi.org/10.1145/1109557.1109577Google Scholar
- K. Elbassioni. 2012. A QPTAS for -envy-free profit-maximizing pricing on line graphs. In Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP 2012), Part II. 513–524.Google ScholarDigital Library
- K. Elbassioni, R. Raman, S. Ray, and R. Sitters. 2009. On profit-maximizing pricing for the highway and tollbooth problems. In Proceedings of the Second International Symposium on Algorithmic Game Theory. Lecture Notes in Computer Science, volume 5814. Springer, 275–286.Google Scholar
- K. Elbassioni, R. Sitters, and Y. Zhang. 2007. A quasi-PTAS for profit-maximizing pricing on line graphs. In ESA ’07, Lecture Notes in Computer Science, Vol. 4698, L. Arge, M. Hoffmann, and E. Welzl (Eds.). Springer, 451–462. http://dblp.uni-trier.de/db/conf/esa/esa2007.html#ElbassioniSZ07Google Scholar
- V. Guruswami, J. D. Hartline, A. R. Karlin, D. Kempe, C. Kenyon, and F. McSherry. 2005. On profit-maximizing envy-free pricing. In SODA. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1164–1173.Google Scholar
- A. V. Goldberg, J. D. Hartline, A. R. Karlin, M. Saks, and A. Wright. 2006. Competitive auctions. Games Econ. Behav. 55, 2 (2006), 242–269. DOI:https://doi.org/DOI: 10.1016/j.geb.2006.02.003 Mini Special Issue: Electronic Market Design.Google ScholarCross Ref
- A. Gupta, R. Krauthgamer, and J. R. Lee. 2003. Bounded geometries, fractals, and low-distortion embeddings. In FOCS. 534–543.Google Scholar
- F. Grandoni and T. Rothvoß. 2016. Pricing on paths: A PTAS for the highway problem. SIAM J. Comput. 45, 2 (2016), 216–231. DOI:https://doi.org/10.1137/140998846Google ScholarDigital Library
- I. Gamzu and D. Segev. 2010. A sublogarithmic approximation for highway and tollbooth pricing. In ICALP (1). 582–593.Google Scholar
- A. Grigoriev, J. van Loon, R. Sitters, and M. Uetz. 2006. How to sell a graph: Guidelines for graph retailers. In Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science. 125–136.Google Scholar
- P. W. Glynn, B. Van Roy, and P. Rusmevichientong. 2006. A nonparametric approach to multi-product pricing. Oper. Res. 54, 1 (2006), 82–98.Google ScholarDigital Library
- F. Grandoni and A. Wiese. 2019. Packing cars into narrow roads: PTASs for limited supply highway. In Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019) .54:1–54:14.Google Scholar
- J. D. Hartline and V. Koltun. 2005. Near-optimal pricing in near-linear time. In Algorithms and Data Structures-WADS, F. K. H. A. Dehne, A. López-Ortiz, and J.-R. Sack (Eds.). Lecture Notes in Computer Sciences, Vol. 3608. Springer, 422–431.Google Scholar
- K. Talwar. 2004. Bypassing the embedding: Algorithms for low dimensional metrics. In STOC. 281–290.Google Scholar
- D. P. Williamson and D. B. Shmoys. 2011. The Design of Approximation Algorithms. Cambridge University Press.Google Scholar
Index Terms
- A QPTAS for ɛ-Envy-Free Profit-Maximizing Pricing on Line Graphs
Recommendations
A QPTAS for ε-envy-free profit-maximizing pricing on line graphs
ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part IIWe 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 ...
Envy-free pricing in multi-item markets
In this article, we study revenue maximizing envy-free pricing in multi-item markets: There are m indivisible items with unit supply each and n potential buyers where each buyer is interested in acquiring one item. The goal is to determine allocations (...
On profit-maximizing envy-free pricing
SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithmsWe study the problem of pricing items for sale to consumers so as to maximize the seller's revenue. We assume that for each consumer, we know the maximum amount he would be willing to pay for each bundle of items, and want to find pricings of the items ...
Comments