Publication
In the restricted Santa Claus problem we are given resources R and players P. Every resource j is an element of R. has a value v(j) and every player i is an element of P desires a set of resources R(i). We are interested in distributing the resources to players that desire them. The quality of a solution is measured by the least happy player, i.e., the lowest sum of resource values. This value should be maximized. The local search algorithm by Asadpour et al. [1] and its connection to the configuration LP has proved itself to be a very influential technique for this and related problems.
Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi