TY - GEN
T1 - Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games
AU - Aumann, Y.
AU - Dombb, Y.
N1 - Place of conference:Athens, Greece
PY - 2010
Y1 - 2010
N2 - We analyze the Pareto efficiency, or inefficiency, of solutions to routing games and load balancing games, focusing on Nash equilibria and greedy solutions to these games. For some settings, we show that the solutions are necessarily Pareto optimal. When this is not the case, we provide a measure to quantify the distance of the solution from Pareto efficiency. Using this measure, we provide upper and lower bounds on the “Pareto inefficiency” of the different solutions. The settings we consider include load balancing games on identical, uniformly-related, and unrelated machines, both using pure and mixed strategies, and nonatomic routing in general and some specific networks.
AB - We analyze the Pareto efficiency, or inefficiency, of solutions to routing games and load balancing games, focusing on Nash equilibria and greedy solutions to these games. For some settings, we show that the solutions are necessarily Pareto optimal. When this is not the case, we provide a measure to quantify the distance of the solution from Pareto efficiency. Using this measure, we provide upper and lower bounds on the “Pareto inefficiency” of the different solutions. The settings we consider include load balancing games on identical, uniformly-related, and unrelated machines, both using pure and mixed strategies, and nonatomic routing in general and some specific networks.
UR - http://link.springer.com/chapter/10.1007%2F978-3-642-16170-4_7
M3 - Conference contribution
BT - Third International Symposium on Algorithmic Game Theory (SAGT)
PB - Springer Berlin Heidelberg
ER -