Open AccessMachine load balancing game with linear externalities
Author(s) -
Юлия Васильевна Чиркова,
Julia V. Chirkova
Publication year - 2021
Publication title -
matematičeskaâ teoriâ igr i eë priloženiâ
Language(s) - English
Resource type - Journals
ISSN - 2074-9872
DOI - 10.17076/mgta_2021_2_36
Subject(s) - nash equilibrium , price of anarchy , schedule , externality , computer science , set (abstract data type) , mathematical optimization , game theory , mathematical economics , microeconomics , economics , price of stability , mathematics , monetary policy , programming language , monetary economics , operating system
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.