{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:17Z","timestamp":1725551897031},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309000"},{"type":"electronic","value":"9783540322931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11600930_104","type":"book-chapter","created":{"date-parts":[[2005,11,24]],"date-time":"2005-11-24T14:48:12Z","timestamp":1132843692000},"page":"1033-1045","source":"Crossref","is-referenced-by-count":4,"title":["Nash Equilibria in All-Optical Networks"],"prefix":"10.1007","author":[{"given":"George F.","family":"Georgakopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris J.","family":"Kavvadias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonidas G.","family":"Sioutis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"104_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-4068(74)90037-8","volume":"1","author":"R.J. Aumann","year":"1974","unstructured":"Aumann, R.J.: Subjectivity and correlation in randomized strategies. J. of Mathematical Economics\u00a01, 67\u201396 (1974)","journal-title":"J. of Mathematical Economics"},{"issue":"1","key":"104_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00453-001-0039-1","volume":"31","author":"B. Awerbach","year":"2001","unstructured":"Awerbach, B., Azar, Y., Fiat, A., Leonardi, S., Rosen, A.: On-line competitive algorithms for call admission in optical networks. Algorithmica\u00a031(1), 29\u201343 (2001)","journal-title":"Algorithmica"},{"key":"104_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/3-540-63165-8_207","volume-title":"Automata, Languages and Programming","author":"Y. Bartal","year":"1997","unstructured":"Bartal, Y., Leonardi, S., Rosen, A.: On-line Routing in optical networks. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 516\u2013526. Springer, Heidelberg (1997)"},{"key":"104_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-31856-9_37","volume-title":"STACS 2005","author":"V. Bilo","year":"2005","unstructured":"Bilo, V., Flammini, M., Moscardelli, L.: On Nash Equilibria in Non-cooperative All-Optical Networks. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 448\u2013459. Springer, Heidelberg (2005)"},{"key":"104_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-27796-5_2","volume-title":"Structural Information and Communication Complexity","author":"V. Bilo","year":"2004","unstructured":"Bilo, V., Moscardelli, L.: The Price of Anarchy in All-Optical Networks. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 13\u201322. Springer, Heidelberg (2004)"},{"key":"104_CR6","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, Cambridge (1990)"},{"issue":"1-2","key":"104_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","volume":"255","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theoretical Computer Science\u00a0255(1-2), 33\u201350 (2001)","journal-title":"Theoretical Computer Science"},{"key":"104_CR8","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of time-table and multicommodity flow problems. SIAM journal of Computing\u00a05, 691\u2013703 (1976)","journal-title":"SIAM journal of Computing"},{"key":"104_CR9","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Tulwar, K.: The Complexity of pure Nash equilibria. In: STOC 2004, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"104_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronikolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"key":"104_CR11","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. Freeman, New York (1979)"},{"key":"104_CR12","unstructured":"Li, G., Simha, R.: On the wavelength assignment problem in multifiber WDM star and ring networks. In: Proceedings of INFOCOM, pp. 1771\u20131780 (2000)"},{"key":"104_CR13","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in n-person games. Proc. of National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proc. of National Academy of Sciences"},{"key":"104_CR14","unstructured":"Nomikos, C.: Path coloring in graphs. Phd dissertation. Dept. of Electrical and Computer Engineering, NTUA (1997)"},{"key":"104_CR15","doi-asserted-by":"crossref","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in all-optical rings. In: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM 2003), San Francisco, CA, USA, March 30 - April 3 (2003)","DOI":"10.1109\/INFCOM.2003.1208971"},{"key":"104_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-24693-0_13","volume-title":"NETWORKING 2004. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications","author":"C. Nomikos","year":"2004","unstructured":"Nomikos, C., Pagourtzis, A., Potika, K., Zachos, S.: Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol.\u00a03042, pp. 150\u2013161. Springer, Heidelberg (2004)"},{"key":"104_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(91)90245-D","volume":"37","author":"S. Olariu","year":"1991","unstructured":"Olariu, S.: An optimal greedy heuristic to color interval graphs. Information Processing Letters\u00a037, 21\u201325 (1991)","journal-title":"Information Processing Letters"},{"key":"104_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/11427186_19","volume-title":"Experimental and Efficient Algorithms","author":"P.N. Panagopoulou","year":"2005","unstructured":"Panagopoulou, P.N., Spirakis, P.G.: Efficient convergence to pure Nash equilibria in weighted network congestion games. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 203\u2013215. Springer, Heidelberg (2005)"},{"key":"104_CR19","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Computing correlated equilibria in multi-player games. In: ACM Symposium on Theory of Computing archive Proceedings of the 37th ACM symp. on Theory of computing, 2005, Baltimore, MD, USA, pp. 49\u201356 (2005)","DOI":"10.1145\/1060590.1060598"},{"key":"104_CR20","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Roughgarden, T.: Computing Equilibria in Multi-Player Games. In: SODA 2005, pp. 82\u201391 (2005)","DOI":"10.1145\/1060590.1060598"},{"key":"104_CR21","doi-asserted-by":"crossref","unstructured":"Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proc. of STOC, pp. 134\u2013143 (1994)","DOI":"10.1145\/195058.195119"},{"key":"104_CR22","doi-asserted-by":"crossref","unstructured":"Sharma, S., Varvarigos, E.: Limited wavelength translation in all-optical WDM mesh networks. In: Proceedings of INFOCOM, pp. 893\u2013901 (1998)","DOI":"10.1109\/INFCOM.1998.665114"},{"key":"104_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-46632-0_37","volume-title":"Algorithms and Computations","author":"S. Vempala","year":"1999","unstructured":"Vempala, S., Voking, B.: Approximating multicast congestion. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol.\u00a01741, pp. 367\u2013372. Springer, Heidelberg (1999)"},{"key":"104_CR24","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1142\/S0219198999000219","volume":"1","author":"M. Voorneveld","year":"1999","unstructured":"Voorneveld, M., Borm, P., van Megen, F., Tijs, S., Facchini, G.: Congestion games and potentials reconsidered. International Game Theory Review\u00a01, 283\u2013299 (1999)","journal-title":"International Game Theory Review"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11600930_104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:01:03Z","timestamp":1619506863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11600930_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309000","9783540322931"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11600930_104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}