Sciweavers

98 search results - page 1 / 20
» On the hardness of pricing loss-leaders
Sort
View
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
WINE
2007
Springer
126views Economy» more  WINE 2007»
13 years 11 months ago
A Theory of Loss-Leaders: Making Money by Pricing Below Cost
We consider the problem of assigning prices to goods of fixed marginal cost in order to maximize revenue in the presence of single-minded customers. We focus in particular on the...
Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Cha...
WINE
2010
Springer
178views Economy» more  WINE 2010»
13 years 2 months ago
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
Patrick Briest, Parinya Chalermsook, Sanjeev Khann...
PODS
2012
ACM
297views Database» more  PODS 2012»
11 years 7 months ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...