Sciweavers

22 search results - page 5 / 5
» Approximating Min-Max (Regret) Versions of Some Polynomial P...
Sort
View
WAOA
2010
Springer
236views Algorithms» more  WAOA 2010»
14 years 7 months ago
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
Patrick Briest, Heiko Röglin
83
Voted
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
15 years 10 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...