The price of anarchy in an exponential multi-server

Operations Research Letters

Volumn 35, Issue 4, 2007, Pages 421-426

  Haviv, Moshe ^a   Roughgarden, Tim ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Multi server queues; Price of anarchy

Indexed keywords

OPTIMIZATION; QUEUEING THEORY; SERVERS;

MULTI-SERVER QUEUES; PRICE OF ANARCHY (POA);

OPERATIONS RESEARCH;

EID: 34248586694     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2006.09.005     Document Type: Article

References (11)

1. Bell C.H., and Stidham S. Individual versus social optimization in the allocation of customers to alternative servers. Manage. Sci. 29 (1983) 831-839
2. Czumaj A. Selfish routing on the Internet. In: Leung J. (Ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004), CRC Press, Boco Raton, FL (Chapter 42)
3. Dafermos S.C., and Sparrow F.T. The traffic assignment problem for a general network. J. Res. Nat. Bur. Stand. Ser. B 73 2 (1969) 91-118
4. Feldmann R., Gairing M., Lücking T., Monien B., and Rode M. Selfish routing in non-cooperative networks: a survey. Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science vol. 2747 (2003), Springer, Berlin 21-45
5. E.J. Friedman, Genericity and congestion control in selfish routing, in: Proceedings of the 43rd Annual IEEE Conference on Decision and Control (CDC), 2004, pp. 4667-4672.
6. Hassin R., and Haviv M. To Queue or not to Queue: Equilibrium Behavior in Queueing Systems (2003), Kluwer's International Series, Boston, MA
7. Koutsoupias E., and Papadimitriou C.H. Worst-case equilibria. Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science vol. 1563 (1999), Springer, Berlin 404-413
8. Papadimitriou C.H. Algorithms, games, and the Internet. Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC) (2001) 749-753
9. Roughgarden T. The price of anarchy is independent of the network topology. J. Comput. Syst. Sci. 67 2 (2003) 341-364
10. Roughgarden T. Selfish Routing and the Price of Anarchy (2005), MIT Press, Cambridge, MA
11. Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods (1985), Prentice-Hall, Englewood Cliffs, NJ