Sciweavers

SODA
2012
ACM
226views Algorithms» more  SODA 2012»
11 years 7 months ago
On the hardness of pricing loss-leaders
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
Preyas Popat, Yi Wu