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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Aumann, Y., & Dombb, Y. (2010). Pareto efficiency and approximate pareto efficiency in routing and load balancing games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6386 LNCS, pp. 66–77). https://doi.org/10.1007/978-3-642-16170-4_7
Mendeley helps you to discover research relevant for your work.