An instance of a weighted Stackelberg load balancing game is given by a set of identical machines, a set of variable-length jobs and a parameter 0 ≤ α ≤ 1. A centralized authority, denoted the leader, selects a subset of the jobs whose total length is at most an α-fraction of the total length and determines their assignment on the machines. After the controlled jobs are assigned, the remaining jobs join the schedule. They act selfishly, each determining its own assignment. Our work combines theoretical and experimental results for this setting. We suggest various heuristics for the leader and analyze their performance.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.