M. Tismenetsky
International Journal of Computer Mathematics
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. © 2008 Elsevier B.V. All rights reserved.
M. Tismenetsky
International Journal of Computer Mathematics
Heng Cao, Haifeng Xi, et al.
WSC 2003
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997