The anarchy of scheduling without money
We consider the scheduling problem on n strategic unrelated machines when no payments are allowed, under the objective of minimizing the makespan. We adopt the model introduced in [Koutsoupias 2014] where a machine is bound by her declarations in the sense that if she is assigned a particular job th...
| Hlavní autoři: | , , |
|---|---|
| Médium: | Journal article |
| Jazyk: | English |
| Vydáno: |
Elsevier
2019
|