Network uncertainty in selfish routing

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Georgiou, Chryssis ^a   Pavlides, Theophanis ^a   Philippou, Anna ^a  

^a UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; ROUTERS;

KP-MODEL; NASH EQUILIBRIUM; PARALLEL LINKS; ROUTING;

COMPUTER NETWORKS;

EID: 33847168144     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639342     Document Type: Conference Paper

References (23)

1. th Annual ACM Symposium on Theory of Computing, pages 67-73, 2005.
2. th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 413-420, 2002.
3. th Annual ACM Symposium on Theory of Computing, pages 604-612, 2004.
4. th International Colloquium of Automata, Languages and Programming, LNCS 2719, pages 514-526, 2003.
5. th International Symposium on Mathematical Foundations of Computer Science, LNCS 2747, pages 21-45, 2003.
6. th International Colloquium, LNCS 2380, pages 123-134, 2002.
7. th Italian Conference of Theoretical Computer Science, LNCS 2841, pages 1-20, 2003.
8. th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 203-212, 2005.
9. C. Georgiou, T. Pavlides, and A. Philippou. Network uncertainty in selfish routing. Technical report, DELIS - Dynamically Evolving, Large-Scale Information Systems, 2005. Submitted for publication.
10. R. L. Graham. Bounds on Multiprocessing Timing Anomalies. SIAM Journal on Applied Mathematics, 17:416-429, 1969.
11. J. C. Harsanyi. Games with Incomplete Information Played by Bayesian Players, I, II, III. Management Science, 14:159-182, 320-332, 468-502, 1967.
12. E. Koutsoupias, M. Mavronicolas, and P. Spirakis. Approximate Equilibria and Ball Fusion. Theory of Computer Systems, 36(6):683-693, 2003.
13. th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 1563, pages 404-413, 1999.
14. st International Symposium of Theoretical Aspects of Computer Science, LNCS 2996, pages 547-558, 2004.
15. th International Symposium of Mathematical Foundations of Computer Science, LNCS 2747, pages 551-561, 2003.
16. th Annual ACM Symposium on Theory of Computing, pages 510-519, 2001.
17. I. Milchtaich. Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior, 13(1):111-124, 1996.
18. D. Mondener and L. S. Shapley. Potential Games. Games and Economic Behavior, 14(1):124-143, 1996.
19. B. Monien. Personal Communication. October, 2005.
20. J. F. Nash. Equilibrium Points in n-Person Games. Proceedings of the National Acanemy of Sciences of the United States of America, 36:48-49, 1950.
21. J. F. Nash. Non-Cooperative Games. Annals of Mathematics, 54(2):286-295, 1951.
22. th Annual ACM Symposium on Theory of Computing, pages 749-753, 2001.
23. R. W. Rosenthal. A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory, 2:65-67, 1973.