Sankar Basu
Journal of the Franklin Institute
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.
Sankar Basu
Journal of the Franklin Institute
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Matthew A Grayson
Journal of Complexity
A.R. Gourlay, G. Kaye, et al.
Proceedings of SPIE 1989