2020/06/10 · The goal is to design coordination mechanisms (local policies) with a small price of anarchy (PoA) for the scheduling game of favorite machines.

2020/06/10 · The goal is to design coordination mechanisms (local policies) with a small price of anarchy (PoA) for the scheduling game of favorite machines.

This paper studies the favorite machine model, where each machine has different speed for different types of jobs. The model is a natural generalization of ...

Coordination mechanisms for scheduling selfish jobs with favorite machines · List of references · Publications that cite this publication.

In this paper, we design and analyze scheduling policies, or coordination mechanisms, for machines which aim to minimize the price of anarchy of the ...

We study coordination mechanisms for four classes of multiprocessor machine scheduling problems and derive upper and lower bounds on the price of anarchy of ...

In machine scheduling, a set of jobs must be scheduled on a set of machines so as to minimize some global objective function, such as the makespan, ...

2017/12/01 · Machines are equipped with coordination mechanisms to diminish chaos caused by jobs' competition. We consider three coordination mechanisms in ...

Three new coordination mechanisms for scheduling n selfish jobs on m unrelated machines are presented, one of which is the first that handles anonymous jobs ...

2018/03/01 · Coordination mechanisms aim to mitigate the impact of selfishness when scheduling jobs to different machines. Such a mechanism defines a ...