Machine load balancing game with linear externalities

  • Юлия Васильевна Чиркова Институт прикладных математических исследований Карельского научного центра РАН
  • Julia Chirkova Institute of Applied MAthematical Research Karelian Research Centre of RAS
DOI: https://doi.org/10.17076/mgta_2021_2_36
Keywords: machine load balancing game, linear externalities, Nash equilibrium, price of anarchy

Abstract

The Machine Load Balancing Game with linear externalities is considered. A set of jobs is to be assigned to a set of machines with different latencies depending on their own loads and also loads on other machines. Jobs choose machines to minimize their own latencies. The social cost of a schedule is the maximum delay among all machines, i.e. {\it makespan. For the case of two machines in this model an Nash equilibrium existence is proven and of the expression for the Price of Anarchy is obtained.

Published
2021-10-20
How to Cite
Чиркова, Ю., & Chirkova, J. (2021). Machine load balancing game with linear externalities. Mathematical Game Theory and Applications, 13(2), 62-79. https://doi.org/10.17076/mgta_2021_2_36
Issue
Vol 13 No 2 (2021): Mathematical game theory and applications
Section
Статьи
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.