Max-min fair allocation of indivisible goods

By D. Golovin. 2005

83 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/bde7b470c35427533949e355f1447bebc85df425

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Vincent Conitzer
2. Felix Brandt
3. Jérôme Lang
4. Nikhil Bansal
5. Ariel D. Procaccia
6. U. Endriss
7. Maxim Sviridenko
8. Andreas Krause

Citations in the corpus

• The Santa Claus problem (2006, background): “Our setting is similar, but the objective function is di.er­ent.”
• Handbook of Computational Social Choice (2016, background): “We start with a bad news: if we make no assumption on the preferences of agents (beyond monotonicity), then not only is computing an optimal maxmin allocation computationally hard, but even computing an approximation is (Golovin, 2005).”