Envy-Free Pricing with General Supply Constraints
- Cite this paper as:
- Im S., Lu P., Wang Y. (2010) Envy-Free Pricing with General Supply Constraints. In: Saberi A. (eds) Internet and Network Economics. WINE 2010. Lecture Notes in Computer Science, vol 6484. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.