5 citations · 5 across the 1 of their papers we have counts for
2 papers
cs.DS2014
On the Configuration LP for Maximum Budgeted Allocation
Christos Kalaitzis, Aleksander Mcadry, Alantha Newman +2
We study the Maximum Budgeted Allocation problem, i.e., the problem of selling a set of indivisible goods to players, each with a separate budget, such that we maximize the…
cs.DS2012★ 5 cited
Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation
Lukas Polacek, Ola Svensson
The restricted max-min fair allocation problem (also known as the restricted Santa Claus problem) is one of few problems that enjoys the intriguing status of having a better estima…