TY - GEN
T1 - Pricing commodities, or how to sell when buyers have restricted valuations
AU - Krauthgamer, Robert
AU - Mehta, Aranyak
AU - Rudra, Atri
PY - 2008
Y1 - 2008
N2 - How should a seller price his goods in a market where each buyer prefers a single good among his desired goods, and will buy the cheapest such good, as long as it is within his budget? We provide efficient algorithms that compute near-optimal prices for this problem, focusing on a commodity market, where the range of buyer budgets is small. We also show that our technique (which is based on LP-rounding) easily extends to a different scenario, in which the buyers want to buy all the desired goods, as long as they are within budget.
AB - How should a seller price his goods in a market where each buyer prefers a single good among his desired goods, and will buy the cheapest such good, as long as it is within his budget? We provide efficient algorithms that compute near-optimal prices for this problem, focusing on a commodity market, where the range of buyer budgets is small. We also show that our technique (which is based on LP-rounding) easily extends to a different scenario, in which the buyers want to buy all the desired goods, as long as they are within budget.
UR - https://www.scopus.com/pages/publications/49949092760
U2 - 10.1007/978-3-540-77918-6_1
DO - 10.1007/978-3-540-77918-6_1
M3 - Conference contribution
AN - SCOPUS:49949092760
SN - 3540779175
SN - 9783540779179
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 14
BT - Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers
T2 - 5th International Workshop on Approximation and Online Algorithms, WAOA 2007
Y2 - 11 October 2007 through 12 October 2007
ER -