{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T16:00:43Z","timestamp":1720886443975},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,7,30]],"date-time":"2011-07-30T00:00:00Z","timestamp":1311984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s00224-011-9355-2","type":"journal-article","created":{"date-parts":[[2011,7,29]],"date-time":"2011-07-29T06:23:32Z","timestamp":1311920612000},"page":"559-578","source":"Crossref","is-referenced-by-count":5,"title":["The Impact of Social Ignorance on Weighted Congestion Games"],"prefix":"10.1007","volume":"50","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[]},{"given":"Vasilis","family":"Gkatzelis","sequence":"additional","affiliation":[]},{"given":"Alexis C.","family":"Kaporis","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,30]]},"reference":[{"issue":"6","key":"9355_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1455248.1455249","volume":"55","author":"H. Ackermann","year":"2008","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 25 (2008). doi: 10.1145\/1455248.1455249","journal-title":"J. ACM"},{"key":"9355_CR2","series-title":"LNCS","first-page":"218","volume-title":"Proc. of the 23st Symp. on Theoretical Aspects of Computer Science (STACS \u201906)","author":"S. Aland","year":"2006","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. In: Proc. of the 23st Symp. on Theoretical Aspects of Computer Science (STACS \u201906). LNCS, vol.\u00a03884, pp.\u00a0218\u2013229. Springer, Berlin (2006)"},{"issue":"4","key":"9355_CR3","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"9355_CR4","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/978-3-540-92185-1_73","volume-title":"Proc. of the 4th Workshop on Internet and Network Economics (WINE \u201908)","author":"I. Ashlagi","year":"2008","unstructured":"Ashlagi, I., Krysta, P., Tennenholtz, M.: Social context games. In: Proc. of the 4th Workshop on Internet and Network Economics (WINE \u201908). LNCS, vol.\u00a05385, pp.\u00a0675\u2013683. Springer, Berlin (2008)"},{"key":"9355_CR5","first-page":"57","volume-title":"Proc. of the 37th ACM Symp. on Theory of Computing (STOC \u201905)","author":"B. Awerbuch","year":"2005","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. of the 37th ACM Symp. on Theory of Computing (STOC \u201905), pp. 57\u201366 (2005)"},{"key":"9355_CR6","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/1386790.1386832","volume-title":"Proc. of the 9th ACM Conf. on Electronic Commerce (EC \u201908)","author":"B. Awerbuch","year":"2008","unstructured":"Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: Proc. of the 9th ACM Conf. on Electronic Commerce (EC \u201908), pp. 264\u2013273 (2008)"},{"key":"9355_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-540-92185-1_16","volume-title":"Proc. of the 4th Workshop on Internet and Network Economics (WINE \u201908)","author":"V. Bil\u00f2","year":"2008","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: Graphical congestion games. In: Proc. of the 4th Workshop on Internet and Network Economics (WINE \u201908). LNCS, vol.\u00a05385, pp. 70\u201381. Springer, Berlin (2008)"},{"issue":"3","key":"9355_CR8","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1016\/j.tcs.2009.10.007","volume":"411","author":"V. Bil\u00f2","year":"2010","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: When ignorance helps: graphical multicast cost sharing games. Theor. Comput. Sci. 411(3), 660\u2013671 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9355_CR9","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. Algorithmica (2010). doi: 10.1007\/s00453-010-9427-8","DOI":"10.1007\/s00453-010-9427-8"},{"key":"9355_CR10","first-page":"169","volume-title":"Proc. of the 18th Symp. on Discrete Algorithms (SODA \u201907)","author":"S. Chien","year":"2007","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. In: Proc. of the 18th Symp. on Discrete Algorithms (SODA \u201907), pp. 169\u2013178 (2007)"},{"key":"9355_CR11","first-page":"67","volume-title":"Proc. of the 37th ACM Symp. on Theory of Computing (STOC \u201905)","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. of the 37th ACM Symp. on Theory of Computing (STOC \u201905), pp. 67\u201373 (2005)"},{"key":"9355_CR12","series-title":"LNCS","first-page":"59","volume-title":"Proc. of the 13th European Symposium on Algorithms (ESA \u201905)","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Proc. of the 13th European Symposium on Algorithms (ESA \u201905). LNCS, vol.\u00a03669, pp. 59\u201370. Springer, Berlin (2005)"},{"key":"9355_CR13","series-title":"LNCS","volume-title":"Proc. of the 17th European Symposium on Algorithms (ESA \u201909)","author":"G. Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.: On the performance of approximate equilibria in congestion games. In: Proc. of the 17th European Symposium on Algorithms (ESA \u201909). LNCS, vol.\u00a05757. Springer, Berlin (2009)"},{"key":"9355_CR14","first-page":"604","volume-title":"Proc. of the 36th ACM Symp. on Theory of Computing (STOC \u201904)","author":"A. Fabrikant","year":"2004","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. of the 36th ACM Symp. on Theory of Computing (STOC \u201904), pp. 604\u2013612 (2004)"},{"key":"9355_CR15","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1007\/978-3-540-70575-8_65","volume-title":"Proc. of the 35th Colloq. on Automata, Languages and Programming (ICALP \u201908)","author":"A. Fanelli","year":"2008","unstructured":"Fanelli, A., Flammini, M., Moscardelli, L.: The speed of convergence in congestion games under best response dynamics. In: Proc. of the 35th Colloq. on Automata, Languages and Programming (ICALP \u201908). LNCS, vol.\u00a05125, pp. 796\u2013807. Springer, Berlin (2008)"},{"key":"9355_CR16","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-642-10841-9_7","volume-title":"Proc. of the 5th Workshop on Internet and Network Economics (WINE \u201909)","author":"A. Fanelli","year":"2009","unstructured":"Fanelli, A., Moscardelli, L.: On best response dynamics in weighted congestion games with polynomial delays. In: Proc. of the 5th Workshop on Internet and Network Economics (WINE \u201909). LNCS, vol.\u00a05929, pp. 55\u201366. Springer, Berlin (2009)"},{"key":"9355_CR17","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D. Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. Theor. Comput. Sci. 348, 226\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9355_CR18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00224-007-9015-8","volume":"42","author":"M. Gairing","year":"2008","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Selfish routing with incomplete information. Theory Comput. Syst. 42, 91\u2013130 (2008)","journal-title":"Theory Comput. Syst."},{"key":"9355_CR19","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/978-3-540-72951-8_25","volume-title":"14th Colloq. on Structural Information and Communication Complexity (SIROCCO \u201907)","author":"G. Karakostas","year":"2007","unstructured":"Karakostas, G., Kim, T., Viglas, A., Xia, H.: Selfish routing with oblivious users. In: 14th Colloq. on Structural Information and Communication Complexity (SIROCCO \u201907). LNCS, vol.\u00a04474, pp. 318\u2013327. Springer, Berlin (2007)"},{"key":"9355_CR20","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/978-3-540-74456-6_54","volume-title":"Proc. of the 32nd Symp. on Mathematical Foundations of Computer Science (MFCS \u201907)","author":"E. Koutsoupias","year":"2007","unstructured":"Koutsoupias, E., Panagopoulou, P., Spirakis, P.: Selfish load balancing under partial knowledge. In: Proc. of the 32nd Symp. on Mathematical Foundations of Computer Science (MFCS \u201907). LNCS, vol.\u00a04708, pp.\u00a0609\u2013620. Springer, Berlin (2007)"},{"issue":"2","key":"9355_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E. Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"9355_CR22","doi-asserted-by":"crossref","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 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"9355_CR23","first-page":"355","volume-title":"Proc. of the 40th ACM Symp. on Theory of Computing (STOC \u201908)","author":"A. Skopalik","year":"2008","unstructured":"Skopalik, A., V\u00f6cking, B.: Inapproximability of pure Nash equilibria. In: Proc. of the 40th ACM Symp. on Theory of Computing (STOC \u201908), pp. 355\u2013364 (2008)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9355-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9355-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9355-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T14:56:47Z","timestamp":1560437807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9355-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,30]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9355"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9355-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,30]]}}}