{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:05:31Z","timestamp":1761973531721,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_3","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T12:57:16Z","timestamp":1368622636000},"page":"25-36","source":"Crossref","is-referenced-by-count":2,"title":["Selfish Resource Allocation in Optical Networks"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Bampas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Pierrakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilis","family":"Syrgkanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory\u00a02, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Selfish routing and the price of anarchy. The MIT Press (2005)","DOI":"10.21236\/ADA637949"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"issue":"5","key":"3_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0020-0190(01)00167-3","volume":"80","author":"C. Nomikos","year":"2001","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Routing and path multicoloring. Inf. Process. Lett.\u00a080(5), 249\u2013256 (2001)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comnet.2004.11.028","volume":"50","author":"C. Nomikos","year":"2006","unstructured":"Nomikos, C., Pagourtzis, A., Potika, K., Zachos, S.: Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. Computer Networks\u00a050(1), 1\u201314 (2006)","journal-title":"Computer Networks"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Andrews, M., Zhang, L.: Complexity of wavelength assignment in optical network optimization. In: INFOCOM. IEEE (2006)","DOI":"10.1109\/INFOCOM.2006.164"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.jcss.2005.08.001","volume":"72","author":"M. Andrews","year":"2006","unstructured":"Andrews, M., Zhang, L.: Minimizing maximum fiber requirement in optical networks. J. Comput. Syst. Sci.\u00a072(1), 118\u2013131 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/90.909024","volume":"9","author":"G. Li","year":"2001","unstructured":"Li, G., Simha, R.: On the wavelength assignment problem in multifiber WDM star and ring networks. IEEE\/ACM Trans. Netw.\u00a09(1), 60\u201368 (2001)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1007\/3-540-45022-X_64","volume-title":"Automata, Languages and Programming","author":"L. Margara","year":"2000","unstructured":"Margara, L., Simon, J.: Wavelength assignment problem on all-optical networks with k fibres per link. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 768\u2013779. Springer, Heidelberg (2000)"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1109\/TNET.2011.2173948","volume":"20","author":"E. Bampas","year":"2012","unstructured":"Bampas, E., Pagourtzis, A., Pierrakos, G., Potika, K.: On a noncooperative model for wavelength assignment in multifiber optical networks. IEEE\/ACM Trans. Netw.\u00a020(4), 1125\u20131137 (2012)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/11775096_9","volume-title":"Algorithmic Aspects in Information and Management","author":"C. Busch","year":"2006","unstructured":"Busch, C., Magdon-Ismail, M.: Atomic routing games on maximum congestion. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 79\u201391. Springer, Heidelberg (2006)"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. The Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"The Annals of Mathematics"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Banner, R., Orda, A.: Bottleneck routing games in communication networks. In: INFOCOM. IEEE (2006)","DOI":"10.1109\/INFOCOM.2006.226"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Mitzenmacher, M. (ed.) STOC, pp. 513\u2013522. ACM (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"3_CR17","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., Mavronicolas, 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)"},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1016770831869","volume":"17","author":"L. Libman","year":"2001","unstructured":"Libman, L., Orda, A.: Atomic resource sharing in noncooperative networks. Telecommunication Systems\u00a017(4), 385\u2013409 (2001)","journal-title":"Telecommunication Systems"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-16170-4_20","volume-title":"Algorithmic Game Theory","author":"R. Kannan","year":"2010","unstructured":"Kannan, R., Busch, C.: Bottleneck congestion games with logarithmic price of anarchy. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol.\u00a06386, pp. 222\u2013233. Springer, Heidelberg (2010)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-15781-3_3","volume-title":"Algorithms \u2013 ESA 2010","author":"T. Harks","year":"2010","unstructured":"Harks, T., Hoefer, M., Klimm, M., Skopalik, A.: Computing pure Nash and strong equilibria in bottleneck congestion games. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 29\u201338. Springer, Heidelberg (2010)"},{"key":"3_CR21","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. Bil\u00f2","year":"2004","unstructured":"Bil\u00f2, 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":"3_CR22","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. Bil\u00f2","year":"2005","unstructured":"Bil\u00f2, 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":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1007\/11600930_104","volume-title":"Internet and Network Economics","author":"G.F. Georgakopoulos","year":"2005","unstructured":"Georgakopoulos, G.F., Kavvadias, D.J., Sioutis, L.G.: Nash equilibria in all-optical networks. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 1033\u20131045. Springer, Heidelberg (2005)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-77294-1_8","volume-title":"Combinatorial and Algorithmic Aspects of Networking","author":"I. Milis","year":"2007","unstructured":"Milis, I., Pagourtzis, A., Potika, K.: Selfish routing and path coloring in all-optical networks. In: Janssen, J., Pra\u0142at, P. (eds.) CAAN 2007. LNCS, vol.\u00a04852, pp. 71\u201384. Springer, Heidelberg (2007)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 295\u2013304 (October 2004)","DOI":"10.1109\/FOCS.2004.68"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:09:33Z","timestamp":1746007773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}