Pareto efficiency and approximate pareto efficiency in routing and load balancing games

Authors:
Yonatan Aumann;Yair Dombb
Affiliations:
Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel;Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel
Venue:
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Year:
2010

Citing 10
Cited 1

Inefficiency of Nash equilibria

Mathematics of Operations Research
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The price of anarchy is independent of the network topology

Journal of Computer and System Sciences - STOC 2002
The Price of Stability for Network Design with Fair Cost Allocation

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Algorithmic Game Theory

Algorithmic Game Theory
Approximate Strong Equilibrium in Job Scheduling Games

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Convergence time to Nash equilibria

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

SIAM Journal on Computing
Approximating the pareto front of multi-criteria optimization problems

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

On the quality and complexity of pareto equilibria in the job scheduling game

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.