A.R. Conn, Nick Gould, et al.
Mathematics of Computation
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.
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Simeon Furrer, Dirk Dahlhaus
ISIT 2005