Envy-Free Pricing with General Supply Constraints
The envy-free pricing problem can be stated as finding a pricing and allocation scheme in which each consumer is allocated a set of items that maximize her utility under the pricing. The goal is to maximize seller revenue. We study the problem with general supply constraints which are given as an independence system defined over the items. The constraints, for example, can be a number of linear constraints or matroids. This captures the situation where items do not pre-exist, but are produced in reflection of consumer valuation of the items under the limit of resources.
This paper focuses on the case of unit-demand consumers. In the setting, there are n consumers and m items; each item may be produced in multiple copies. Each consumer i ∈ [n] has a valuation v ij on item j in the set S i in which she is interested. She must be allocated (if any) an item which gives the maximum (non-negative) utility. Suppose we are given an α-approximation oracle for finding the maximum weight independent set for the given independence system (or a slightly stronger oracle); for a large number of natural and interesting supply constraints, constant approximations are available. We obtain the following results.
O(αlogn)-approximation for the general case.
O(αk)-approximation when each consumer is interested in at most k distinct types of items.
O(αf)-approximation when each item is interesting to at most f consumers.
- Balcan, M.-F., Blum, A. (2006) Approximation algorithms and online mechanisms for item pricing. EC 2006. ACM, New York, pp. 29-35
- Briest, P.: Uniform budgets and the envy-free pricing problem. In: ICALP (1), pp. 808–819 (2008)
- Briest, P., Krysta, P.: Single-minded unlimited supply pricing on sparse instances. In: SODA 2006, pp. 1093–1102 (2006)
- Chekuri, C.: Personal Communication (2010)
- Chekuri, C., Vondrák, J., Zenklusen, R.: Multi-budgeted matchings and matroid intersection via dependent rounding (2010) (manuscript)
- Chen, N., Ghosh, A., Vassilvitskii, S.: Optimal envy-free pricing with metric substitutability. In: EC 2008, pp. 60–69 (2008)
- Frieze, A.M., Clarke, M.R.B. (1984) Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses. European Journal of Operational Research 15: pp. 100-109 CrossRef
- Goldberg, A.V., Hartline, J.D. Competitive auctions for multiple digital goods. In: Meyer auf der Heide, F. eds. (2001) Algorithms - ESA 2001. Springer, Heidelberg, pp. 416-427 CrossRef
- Goldberg, A.V., Hartline, J.D., Wright, A.: Competitive auctions and digital goods. In: SODA, pp. 735–744 (2001)
- Gul, F., Stacchetti, E. (1999) Walrasian equilibrium with gross substitues. Journal of Economic Theory 87: pp. 95-124 CrossRef
- 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)
- Hartline, J.D., Koltun, V. Near-optimal pricing in near-linear time. In: Dehne, F., López-Ortiz, A., Sack, J.-R. eds. (2005) Algorithms and Data Structures. Springer, Heidelberg, pp. 422-431 CrossRef
- Koopmans, T., Beckmann, M. (1957) Assignment problems and the location of economic activities. Econometrica 25: pp. 53-76 CrossRef
- Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Non-monotone submodular maximization under matroid and knapsack constraints. In: STOC, pp. 323–332 (2009)
- Schrijver, A. (2003) Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg
- Envy-Free Pricing with General Supply Constraints
- Book Title
- Internet and Network Economics
- Book Subtitle
- 6th International Workshop, WINE 2010, Stanford, CA, USA, December 13-17, 2010. Proceedings
- pp 483-491
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.