The price of anarchy in all-optical networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3104, Issue , 2004, Pages 13-22

  Bilò, Vittorio ^a   Moscardelli, Luca ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COSTS; GAME THEORY; OPTICAL COMMUNICATION; TELECOMMUNICATION NETWORKS;

ALL- OPTICAL NETWORKS; LOSS OF PERFORMANCE; OPTIMAL SOLUTIONS; PRICE OF ANARCHY; PURE NASH EQUILIBRIUM; SELFISH AGENTS; SERVICE PROVIDER;

COMPLEX NETWORKS;

EID: 33645623168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27796-5_2     Document Type: Article

References (23)

1. B. Beauquier, J. C. Bermond, L. Gargano, P. Hell, S. Perennes, and U. Vaccaro. Graph problems arising from wavelength-routing in all- optical networks. In Proceedings of the 2nd Workshop on Optics and Computer Science, part of IPPS'97, 1997.
2. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs and non-approximability - towards tight results. SIAM Journal of Computing, 27:804-915, 1998.
3. C. A. Brackett. Dense wavelength division multiplexing networks: principles and applications. IEEE Journal on Selected Areas in Communications, 8:948-964, 1990.
4. N. K. Chung, K. Nosu, and G. Winzer. Special issue on dense WDM networks. IEEE Journal on Selected Areas in Communications, 8, 1990.
5. A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou, and S. Shenker. On a network creation game. In Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), pages 347-351, 2003.
6. A. Fabrikant, C. H. Papadimitriou, and K. Talwar. The complexity of pure nash equilibria. Manuscript.
7. M. Flammini, A. Navarra, and A. Proskurowski. On routing of wavebands for gossiping in all-optical paths and cycles. In Proceedings of the 10th Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 133-146, 2003.
8. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, and P. Spirakis. The structure and complexity of nash equilibria for a selfish routing game. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP) pages 123-134, 2002.
9. L. Gargano and U. Vaccaro. "Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems" in: Numbers, Information and Complexity. Kluwer Academic, 2000.
10. P. E. Green. Fiber-Optic Communication Networks. Prentice Hall, 1992.
11. H. S. Hinton. Architectural considerations for photonic switching networks. IEEE Journal on Selected Areas in Communications, 6:1209-1226, 1988.
12. R. Klasing. Methods and problems of wavelength-routing in all-optical networks. In Proceedings of the MFCS'98 Workshop on Communication, August 24-25, Brno, Czech Republic, pages 1-9, 1998.
13. E. Koutsoupias and C.H. Papadimitriou. Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1563 of LNCS, pages 387-396, 1999.
14. M. Mavronicolas and P. Spirakis. The price of selfish routing. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pages 510-519, 2001.
15. I. Milchtaich. Congestion games with player-specific payoff functions. Games and Economic Behavior, 13:111-124, 1996.
16. J. F. Nash. Equilibrium points in n-person games. In Proceedings of the National Academy of Sciences, volume 36, pages 48-49, 1950.
17. G. Owen. Game theory. Academic Press, 3rd edition, 1995.
18. C. H. Papadimitriou and M. Yannakakis. On complexity as bounded rationality. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC), pages 726-733, 1994.
19. S. Personik. Review of fundamentals of optical fiber systems. IEEE Journal on Selected Areas in Communications, 3:373-380, 1983.
20. R. Ramaswami. Multi-wavelength lightwave networks for computer communication. IEEE Communications Magazine, 31:78-88, 1993.
21. R. W. Rosenthal. A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
22. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of ACM, 49(2):236-259, 2002.
23. A. Vetta. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 416-425, 2002.