Price of anarchy in machine load balancing game

2015 ◽  
Vol 76 (10) ◽  
pp. 1849-1864 ◽  
Author(s):  
Yu. V. Chirkova
Keyword(s):  
Load Balancing ◽  
Price Of Anarchy ◽  
Machine Load

scholarly journals Strong Price of Anarchy for Machine Load Balancing

2007 ◽  
pp. 583-594 ◽  
Author(s):  
Amos Fiat ◽  
Haim Kaplan ◽  
Meital Levy ◽  
Svetlana Olonetsky
Keyword(s):  
Load Balancing ◽  
Price Of Anarchy ◽  
Machine Load

scholarly journals Machine load balancing game with linear externalities

2021 ◽  
Vol 13 (2) ◽  
pp. 62-79
Author(s):  
Юлия Васильевна Чиркова ◽  
Julia Chirkova
Keyword(s):  
Nash Equilibrium ◽  
Load Balancing ◽  
Social Cost ◽  
Price Of Anarchy ◽  
Equilibrium Existence ◽  
Machine Load ◽  
Maximum Delay ◽  
The Social ◽  
Two Machines

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.

A case for on-machine load balancing

2011 ◽  
Vol 71 (4) ◽  
pp. 556-564 ◽  
Author(s):  
Shoukat Ali ◽  
Behdis Eslamnour ◽  
Zehra Shah
Keyword(s):  
Load Balancing ◽  
Machine Load

scholarly journals Computing the Price of Anarchy in Processor Load Balancing Game with Linear Delays

2021 ◽  
Vol 14 ◽  
pp. 72-81
Author(s):  
Julia V. Chirkova ◽  
Keyword(s):  
Load Balancing ◽  
Completion Time ◽  
Social Cost ◽  
Price Of Anarchy ◽  
Exact Analytical Expression ◽  
Computing Algorithm ◽  
Maximum Delay ◽  
The Social ◽  
Linear Delay ◽  
Processor Load

This paper considers a generalization of the processor load balancing game also known as KP-model. A linear delay of a processor may depend on not only its load but on loads of other processors. Players choose processors of different speeds to run their jobs striving to minimize job's delay, i.e., the job completion time on a chosen processor. The social cost is the maximum delay over all processors. We propose a computing algorithm of the exact PoA value which can be applied to estimate the POA visually if its exact analytical expression is not obtained yet or it is rather complicated to figure out its formula.

scholarly journals Price of anarchy in non-cooperative load balancing games

2011 ◽  
Vol 68 (12) ◽  
pp. 1312-1332 ◽  
Author(s):  
U. Ayesta ◽  
O. Brun ◽  
B.J. Prabhu
Keyword(s):  
Load Balancing ◽  
Price Of Anarchy
Sign in / Sign up

Export Citation Format

Share Document