On Nash equilibria in non-cooperative all-optical networks

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 448-459

  Bilò, Vittorio ^a,b   Flammini, Michele ^a   Moscardelli, Luca ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF SALENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; KNOWLEDGE ACQUISITION; PHASE EQUILIBRIA; TOPOLOGY;

OPTICAL NETWORKS; PAYMENT FUNCTIONS; ROUTINGS; WAVELENGTHS;

COMPUTER NETWORKS;

EID: 24144474200     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_37     Document Type: Conference Paper

References (18)

1. Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Theoretical Computer Science - special issue for ICALP 1997, 221(1-2):19-39, 1999.
2. 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.
3. V. Bilò and L. Moscardelli. The price of anarchy in all-optical networks. In Proceedings of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO), volume 3104 of LNCS, pages 13-22. Springer, 2004.
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 equilibria. In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pages 604-612. ACM Press, 2004.
7. 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), LNCS, pages 123-134. Springer, 2002.
8. L. Gargano and U. Vaccaro. "Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems"in: Numbers, Information and Complexity. Kluwer Academic, 2000.
9. H.A. Kierstead and J. Qin. Coloring interval graphs with first-fit. Discrete Mathematics, 144:47-57, 1995.
10. 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.
11. 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.
12. I. Milchtaich. Congestion games with player-specific payoff functions. Games and Economic Behavior, 13:111-124, 1996.
13. G. Owen. Game theory. Academic Press, 3rd edition, 1995.
14. 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.
15. R. W. Rosenthal. A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
16. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of ACM, 49(2):236-259, 2002.
17. M. Slusarek. Optimal on-line coloring of circular arc graphs. Informatique Théorique et Applications, 29(5):423-429, 1995.
18. 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.