The Price of Anarchy in parallel queues revisited

Performance Evaluation Review

Volumn 38, Issue 1 SPEC. ISSUE, 2010, Pages 353-354

  Anselmi, Jonatha ^a   Gaujal, Bruno ^a  

^a INRIA and LIG Laboratory   (France)

Author keywords

Convex programming; Parallel queues; Price of Anarchy; Price of Forgetting

Indexed keywords

BERNOULLI; CONVEX PROGRAMMING; NETWORK LOAD; NETWORK SIZE; NON-OBSERVABLE; NUMERICAL EXPERIMENTS; PARALLEL QUEUES; PRICE OF ANARCHY; UPPER BOUND;

QUEUEING THEORY; ROUTERS;

COSTS;

EID: 77954942445     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1811099.1811083     Document Type: Conference Paper

References (5)

1. J. Anselmi and B. Gaujal. On the price of anarchy and the optimal routing of parallel non-observable queues. INRIA Tech. rep., 2010.
2. C. H. Bell and S. Stidham. Individual versus social optimization in the allocation of customers to alternative servers. Management Science, pages 29:83-839, 1983.
3. M. Haviv and T. Roughgarden. The price of anarchy in an exponential multi-server. Op. Res. Lett., 35(4):421-426, 2007.
4. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In STACS, volume 1563 of LNCS, pages 404-413, January 1999.
5. N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani. Algorithmic Game Theory. Cambridge University Press, New York, NY, USA, 2007.