An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling
- 44 Downloads
Coordination mechanisms aim to mitigate the impact of selfishness when scheduling jobs to different machines. Such a mechanism defines a scheduling policy within each machine and naturally induces a game among the selfish job owners. The desirable properties of a coordination mechanism includes simplicity in its definition and efficiency of the outcomes of the induced game. We present a broad class of coordination mechanisms for unrelated machine scheduling that are simple to define and we identify one of its members (mechanism DCOORD) that is superior to all known mechanisms. In particular, DCOORD induces potential games with logarithmic price of anarchy and only constant price of stability. Both bounds are almost optimal.
KeywordsCoordination mechanisms Potential games Price of anarchy Price of stability Scheduling Unrelated machines
This work was partially supported by Caratheodory grant E.114 from the University of Patras and by project ANR-14-CE24-0007-01 “CoCoRICo-CoDec” . Part of the work was done while the second author was visiting the Institute for Mathematical Sciences, National University of Singapore in 2015.
- 1.Abed, F., Correa, J.R., Huang, C.-C.: Optimal coordination mechanisms for multi-job scheduling games. In: Proceedings of the 22nd European Symposium on Algorithms (ESA), LNCS 8737, Springer, pages 13–24 (2014)Google Scholar
- 2.Abed, F., Huang, C.: Preemptive coordination mechanisms for unrelated machines. In: Proceedings of the 20th Annual European Symposium on Algorithms (ESA), LNCS 7501, Springer, pages 12–23 (2012)Google Scholar
- 3.Awerbuch, B., Azar, Y., Grove, E.F., Kao, M.-Y., Krishnan, P., Vitter, J.S.: Load balancing in the L p norm. In: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 383-391 (1995)Google Scholar
- 5.Bhattacharya, S., Im, S., Kulkarni, J., Munagala, K.: Coordination mechanisms from (almost) all scheduling policies. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science (ITCS), pages 121–134 (2014)Google Scholar
- 6.Caragiannis, I.: Better bounds for online load balancing on unrelated machines. In: Proceedings of the 19th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 972-981 (2008)Google Scholar
- 8.Caragiannis, I., Gkatzelis, V., Vinci, C.: Coordination mechanisms, cost-sharing, and approximation algorithms for scheduling. In: Proceedings of the 13th International Conference on Web and Internet Economics (WINE), LNCS 10660, Springer, pages 74–87 (2017)Google Scholar
- 10.Cohen, J., Dürr, C., Thang, N.K.: Smooth inequalities and equilibrium inefficiency in scheduling games. In: Proceedings of the 8th International Workshop on Internet and Network Economics (WINE), LNCS 7695, Springer, pages 350–363 (2012)Google Scholar