1 |
Y. Azar, "On-line load balancing", Online Algorithms-The State of the Art, pp. 178-195, 1998
|
2 |
T. Lucking, M. Mavronicolas, B. Monien, and M. Rode, "A new model for selfish routing", Pro. 21 th Int. Symp. on Theoretical Aspects of Computer Science, pp. 547-558,2004
|
3 |
J. G. Wardrop, "Some theoretical aspects of road traffic research", Proc.of the Institute of Civil Engineers, Pt. II, Vol. 1, pp. 325-378, 2002
|
4 |
T. Roughgarden, "Stackelberg scheduling strategies", SIAM Journal on Computing, Vol. 33(2),pp.332-350, 2004
DOI
ScienceOn
|
5 |
T. Roughgarden, "The price of anarchy is independent of the network topology", Journal of Computer and System Science, Vol. 67(1), pp. 341-364, 2003
DOI
ScienceOn
|
6 |
J. R. Correa, A. S. Schulz, and N. E. Stier-Moses, "Selfish routing in capacitated networks", Mathematics of Operations Research, Vol. 29(4), pp.961-976, 2004
DOI
ScienceOn
|
7 |
Y. A. Korilis, A. A. Lazar, and A. Orda, "Achieving network optima using Stackelberg routing strategies", IEEE/ACM Transactions on Networking, Vol. 5(1), pp. 161-173, 1997
DOI
ScienceOn
|
8 |
B. Awerbuch, Y. Azar, E. Grove, M. Kao, P. Krishnan, and 1. Vitter, "Load Balancing in the Lp nonn", Proc. 36th Annual Symp. on Foundation of Computer Science, pp. 383-391, 1995
DOI
|
9 |
B. Awerbuch, Y. Azar, and A. Epstein, "The price of routing unsplittable flow", Proc. 37th ACM Symp. on Theory of Computing, pp. 57-66,2005
DOI
|
10 |
E. Koutsoupias and C. Papadimitriou, "Worstcase equilibria", Pro. 16th Int. Symp. on Theoretical Aspects of Computer Science, pp. 404-413, 1999
|
11 |
T. Roughgarden and E. Tardos, "How bad is selfish routing ?", Journal of the ACM, Vol. 49(2), pp.236-259,2002
DOI
ScienceOn
|
12 |
G. Christodoulou and E. Koutsoupias, "The price of anarchy of finite congestion games", Proc. 37th ACM Symp. on Theory of Computing, pp. 67-73, 2005
DOI
|
13 |
M. Garing, T. Lucking, M. Mavronicolas, B. Monien, and M. Rode, "Nash equilibria in discrete routing games with convex latency functions", Proc. 31st Int. Col. on Automata, Languages and Programming, pp. 645-657, 2004
|
14 |
S. Aland, D. Dumrauf, M. Gairing, B. Monien, and F. Schoppmann, "Exact price of anarchy for polynomial congestion games", Pro. 23rd Int. Symp. on Theoretical Aspects of Computer Science,pp.218-229,2006
DOI
ScienceOn
|