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, Theory Comput Syst (2014)] where a machine is bound by her declarations in the sense that if she is assi...

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй
Үндсэн зохиолчид: Giannakopoulos, Y, Koutsoupias, E, Kyropoulou, M
Формат: Journal article
Хэвлэсэн: Springer, Berlin, Heidelberg 2016