Envy-Free Pricing with General Supply Constraints
- Sungjin ImAffiliated withDept. of Computer Science, University of Illinois
- , Pinyan LuAffiliated withMicrosoft Research Asia
- , Yajun WangAffiliated withMicrosoft Research Asia
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.
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.
- 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-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.