The Santa Claus problem
By Nikhil Bansal, Maxim Sviridenko. Symposium on the Theory of Computing, 2006
299 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/be7b3cd5b2f1a8e346ca230200b58401a28a4e3a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Cynthia Dwork
- Moritz Hardt
- Jonathan Ullman
- Toniann Pitassi
- Omer Reingold
- Amin Saberi
- Elchanan Mossel
- Vincent Conitzer
In Computer Networks and Communications
- Amin Saberi
- Elchanan Mossel
- Omer Reingold
- Moritz Hardt
- Cynthia Dwork
- Richard S. Zemel
- Andrei A. Bulatov
- Aranyak Mehta
In Industrial and Manufacturing Engineering
Citations in the corpus
- Fairness through awareness (2011, background): “…all members of a set of long-lived processes, of the di ff erence between the actual load on the process and the so-called desired load (the desired load is a function of the tasks in which the process participates) [AAN + 98]; other notions of fairness appear in [BS06, Fei08, FT11], to name a few.”
- On approximately fair allocations of indivisible goods (2004, background): “For max-min fairness some recent progress has been made in [5, 4, 11].”
- Fair Public Decision Making (2016, background): “However, both these solutions are NP-hard to compute [31, 4].”