{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:24Z","timestamp":1725548964185},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_37","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"448-459","source":"Crossref","is-referenced-by-count":16,"title":["On Nash Equilibria in Non-cooperative All-Optical Networks"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Flammini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"37_CR1","first-page":"19","volume":"221","author":"Y. Bartal","year":"1999","unstructured":"Bartal, Y., Leonardi, S.: On-line routing in all-optical networks. Theoretical Computer Science - special issue for ICALP 1997\u00a0221(1-2), 19\u201339 (1999)","journal-title":"Theoretical Computer Science - special issue for ICALP 1997"},{"key":"37_CR2","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":"37_CR3","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":"37_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":"37_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":"37_CR6","first-page":"604","volume-title":"Proceedings of the 36th ACM Symposium on Theory of Computing (STOC)","author":"A. Fabrikant","year":"2004","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure equilibria. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pp. 604\u2013612. ACM Press, New York (2004)"},{"key":"37_CR7","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":"37_CR8","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":"37_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(94)00285-Q","volume":"144","author":"H.A. Kierstead","year":"1995","unstructured":"Kierstead, H.A., Qin, J.: Coloring interval graphs with first-fit. Discrete Mathematics\u00a0144, 47\u201357 (1995)","journal-title":"Discrete Mathematics"},{"key":"37_CR10","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":"37_CR11","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":"37_CR12","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":"37_CR13","volume-title":"Game theory","author":"G. Owen","year":"1995","unstructured":"Owen, G.: Game theory, 3rd edn. Academic Press, London (1995)","edition":"3"},{"key":"37_CR14","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":"37_CR15","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":"37_CR16","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"},{"issue":"5","key":"37_CR17","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1051\/ita\/1995290504231","volume":"29","author":"M. Slusarek","year":"1995","unstructured":"Slusarek, M.: Optimal on-line coloring of circular arc graphs. Informatique Th\u00e9orique et Applications\u00a029(5), 423\u2013429 (1995)","journal-title":"Informatique Th\u00e9orique et Applications"},{"key":"37_CR18","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","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:29:49Z","timestamp":1605760189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}