Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142698 | Operations Research Letters | 2008 | 6 Pages |
Abstract
We consider the problem of pricing (digital) items in order to maximize the revenue obtainable from a set of bidders. We suggest a natural monotonicity constraint on bundle prices, show that the problem remains NP-hard, and we derive a PTAS. We also briefly discuss the highway pricing problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
A. Grigoriev, J. van Loon, M. Sviridenko, M. Uetz, T. Vredeveld,