{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:20Z","timestamp":1725488960010},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_54","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"609-620","source":"Crossref","is-referenced-by-count":6,"title":["Selfish Load Balancing Under Partial Knowledge"],"prefix":"10.1007","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiota N.","family":"Panagopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"54_CR1","unstructured":"Arrow, K.: The Economics of Information. Harvard University Press (1984)"},{"key":"54_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-540-27836-8_31","volume-title":"Automata, Languages and Programming","author":"G. Christodoulou","year":"2004","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination Mechanisms. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 345\u2013357. Springer, Heidelberg (2004)"},{"key":"54_CR3","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":"54_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/978-3-540-27836-8_55","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash Equilibria in Discrete Routing Games with Convex Latency Functions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 645\u2013657. Springer, Heidelberg (2004)"},{"issue":"1-2","key":"54_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.tcs.2005.05.011","volume":"343","author":"M. Gairing","year":"2005","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Spirakis, P.: Structure and Complexity of Extreme Nash Equilibria. Theoretical Computer Science\u00a0343(1-2), 133\u2013157 (2005)","journal-title":"Theoretical Computer Science"},{"key":"54_CR6","doi-asserted-by":"crossref","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Selfish routing with incomplete information. SPAA 2005, 203\u2013212 (2005)","DOI":"10.1145\/1073970.1074000"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"Georgiades, S., Mavronicolas, M., Spirakis, P.: Optimal, Distributed Decision-Making: The Case of No Communication. In: Proceedings of the 12th International Symposium on Fundamentals of Computation Theory, pp. 293\u2013303 (1999)","DOI":"10.1007\/3-540-48321-7_24"},{"key":"54_CR8","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 1999","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. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"54_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/978-3-540-45138-9_49","volume-title":"Mathematical Foundations of Computer Science 2003","author":"T. L\u00fccking","year":"2003","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M., Spirakis, P., Vrto, I.: Which is the Worst-case Nash Equilibrium? In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 551\u2013561. Springer, Heidelberg (2003)"},{"key":"54_CR10","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.: The Price of Selfish Routing. In: Mavronicolas, M., Spirakis, P. (eds.) Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, July 2001, pp. 510\u2013519 (2001), Also, accepted to Algorithmica","DOI":"10.1145\/380752.380846"},{"key":"54_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/112600.112606","volume-title":"Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the Value of Information in Distributed Decision-Making. In: Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, pp. 61\u201364. ACM Press, New York (1991)"},{"key":"54_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/800135.804414","volume-title":"Proceedings of the 11th ACM Symposium on Theory of Computing (STOC 1979)","author":"A.C. Yao","year":"1979","unstructured":"Yao, A.C.: Some Complexity Questions Related to Distributive Computing. In: Proceedings of the 11th ACM Symposium on Theory of Computing (STOC 1979), pp. 209\u2013213. ACM Press, New York (1979)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:24Z","timestamp":1619519364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}