Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Scheduling Unrelated Machines by Randomized Rounding
SIAM Journal on Discrete Mathematics
(Almost) optimal coordination mechanisms for unrelated machine scheduling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Scalably scheduling processes with arbitrary speedup curves
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Coordination mechanisms for selfish scheduling
Theoretical Computer Science
Minimizing the Worst Slowdown: Offline, Online
Operations Research
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Theoretical Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Better scalable algorithms for broadcast scheduling
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
SIAM Journal on Computing
Inner product spaces for MinSum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing
Resource augmentation for weighted flow-time explained by dual fitting
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An online scalable algorithm for minimizing lk-norms of weighted flow time on unrelated machines
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Smooth inequalities and equilibrium inefficiency in scheduling games
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
| Hi-index | 0.00 |
We study the price of anarchy of coordination mechanisms for a scheduling problem where each job j has a weight wj, processing time pij, assignment cost hij, and communication delay (or release date) rij, on machine i. Each machine is free to declare its own scheduling policy. Each job is a selfish agent and selects a machine that minimizes its own disutility, which is equal to its weighted completion time plus its assignment cost. The goal is to minimize the total disutility incurred by all the jobs. Our model is general enough to capture scheduling jobs in a distributed environment with heterogeneous machines (or data centers) that are situated across different locations. Our main result is a characterization of scheduling policies that give a small (robust) Price of Anarchy. More precisely, we show that whenever each machine independently declares any scheduling policy that satisfies a certain bounded stretch condition introduced in this paper, the game induced between the jobs has a small Price of Anarchy. Our characterization is powerful enough to test almost all popular scheduling policies. On the technical side, to derive our results, we use a potential function whose derivative leads to an instantaneous smoothness condition, and linear programming and dual fitting. To the best of our knowledge, this is a novel application of these techniques in the context of coordination mechanisms, and we believe these tools will find more applications in analyzing PoA of games. We also extend our results to the lk-norms and l∞ norm (makespan) objectives.