{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:33:48Z","timestamp":1725564828144},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222309"},{"type":"electronic","value":"9783540277965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27796-5_2","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T21:47:42Z","timestamp":1283723262000},"page":"13-22","source":"Crossref","is-referenced-by-count":13,"title":["The Price of Anarchy in All-Optical Networks"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Beauquier, B., Bermond, J.C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph problems arising from wavelength-routing in all- optical networks. In: Proceedings of the 2nd Workshop on Optics and Computer Science, part of IPPS 1997 (1997)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539796302531","volume":"27","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability - towards tight results. SIAM Journal of Computing\u00a027, 804\u2013915 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/49.57798","volume":"8","author":"C.A. Brackett","year":"1990","unstructured":"Brackett, C.A.: Dense wavelength division multiplexing networks: principles and applications. IEEE Journal on Selected Areas in Communications\u00a08, 948\u2013964 (1990)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Chung, N.K., Nosu, K., Winzer, G.: Special issue on dense WDM networks. IEEE Journal on Selected Areas in Communications\u00a08 (1990)","DOI":"10.1109\/49.57828"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"2_CR6","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure nash equilibria (manuscript)"},{"key":"2_CR7","unstructured":"Flammini, M., Navarra, A., Proskurowski, A.: 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), pp. 133\u2013146 (2003)"},{"key":"2_CR8","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)"},{"key":"2_CR9","volume-title":"Numbers, Information and Complexity","author":"L. Gargano","year":"2000","unstructured":"Gargano, L., Vaccaro, U.: Routing in All\u2013Optical Networks: Algorithmic and Graph\u2013Theoretic Problems. In: Numbers, Information and Complexity, Kluwer Academic, Dordrecht (2000)"},{"key":"2_CR10","volume-title":"Fiber-Optic Communication Networks","author":"P.E. Green","year":"1992","unstructured":"Green, P.E.: Fiber-Optic Communication Networks. Prentice Hall, Englewood Cliffs (1992)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1109\/49.7842","volume":"6","author":"H.S. Hinton","year":"1988","unstructured":"Hinton, H.S.: Architectural considerations for photonic switching networks. IEEE Journal on Selected Areas in Communications\u00a06, 1209\u20131226 (1988)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2_CR12","unstructured":"Klasing, R.: Methods and problems of wavelength-routing in all-optical networks. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 1\u20139. Springer, Heidelberg (1998)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 387\u2013396. Springer, Heidelberg (1999)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior\u00a013, 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"2_CR16","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. Proceedings of the National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"2_CR17","volume-title":"Game theory","author":"G. Owen","year":"1995","unstructured":"Owen, G.: Game theory, 3rd edn. Academic Press, London (1995)","edition":"3"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On complexity as bounded rationality. In: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC), pp. 726\u2013733 (1994)","DOI":"10.1145\/195058.195445"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1109\/JSAC.1983.1145958","volume":"3","author":"S. Personik","year":"1983","unstructured":"Personik, S.: Review of fundamentals of optical fiber systems. IEEE Journal on Selected Areas in Communications\u00a03, 373\u2013380 (1983)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/35.186364","volume":"31","author":"R. Ramaswami","year":"1993","unstructured":"Ramaswami, R.: Multi-wavelength lightwave networks for computer communication. IEEE Communications Magazine\u00a031, 78\u201388 (1993)","journal-title":"IEEE Communications Magazine"},{"key":"2_CR21","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. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? Journal of ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of ACM"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Vetta, A.: 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), pp. 416\u2013425 (2002)","DOI":"10.1109\/SFCS.2002.1181966"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27796-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:20:58Z","timestamp":1605759658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27796-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222309","9783540277965"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27796-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}