Congestion Games, Load Balancing, and Price of Anarchy

2005 ◽  
pp. 13-27 ◽  
Author(s):  
Anshul Kothari ◽  
Subhash Suri ◽  
Csaba D. Tóth ◽  
Yunhong Zhou
Keyword(s):  
Load Balancing ◽  
Price Of Anarchy ◽  
Congestion Games

scholarly journals Exact Price of Anarchy for Polynomial Congestion Games

2011 ◽  
Vol 40 (5) ◽  
pp. 1211-1233 ◽  
Author(s):  
Sebastian Aland ◽  
Dominic Dumrauf ◽  
Martin Gairing ◽  
Burkhard Monien ◽  
Florian Schoppmann
Keyword(s):  
Price Of Anarchy ◽  
Congestion Games

scholarly journals The Asymptotic Price of Anarchy for k-uniform Congestion Games

2018 ◽  
pp. 317-328 ◽  
Author(s):  
Jasper de Jong ◽  
Walter Kern ◽  
Berend Steenhuisen ◽  
Marc Uetz
Keyword(s):  
Price Of Anarchy ◽  
Congestion Games

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.

Sign in / Sign up

Export Citation Format

Share Document