The price of anarchy in parallel queues revisited

Authors:
Jonatha Anselmi;Bruno Gaujal
Affiliations:
INRIA and LIG Laboratory, MontBonnot Saint-Martin, France;INRIA and LIG Laboratory, MontBonnot Saint-Martin, France
Venue:
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
2010

Citing 3
Cited 2

Algorithmic Game Theory

Algorithmic Game Theory
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The price of anarchy in an exponential multi-server

Operations Research Letters

Competition yields efficiency in load balancing games

Performance Evaluation
The price of forgetting in parallel and non-observable queues

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a network of parallel, non-observable queues and analyze the Price of Anarchy (PoA) from the new point of view where the router has the memory of previous dispatching choices. In the regime where the demands grow with the network size, we provide an upper bound on the PoA by means of convex programming. To study the impact of non-Bernoulli routers, we introduce the Price of Forgetting (PoF) and prove that it is bounded from above by two. Numerical experiments show that the benefit of having memory in the router is independent of the network size and heterogeneity, and monotonically depends on the network load only.