{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:31:32Z","timestamp":1725456692122},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353109"},{"type":"electronic","value":"9783642353116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35311-6_38","type":"book-chapter","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T02:32:28Z","timestamp":1354588348000},"page":"496-503","source":"Crossref","is-referenced-by-count":8,"title":["Convergence of Best-Response Dynamics in Games with Conflicting Congestion Effects"],"prefix":"10.1007","author":[{"given":"Michal","family":"Feldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. In: FOCS 2006, pp. 613\u2013622 (2006)","DOI":"10.1109\/FOCS.2006.55"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: FOCS 2004, pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V.S., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: ACMEC 2008, pp. 264\u2013273 (2008)","DOI":"10.1145\/1386790.1386832"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Chen, B., G\u00fcrel, S.: Efficiency analysis of load balancing games with and without activation costs. Journal of Scheduling\u00a015(2) (2011)","DOI":"10.1007\/s10951-011-0247-8"},{"key":"38_CR5","unstructured":"Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. In: SODA 2007, pp. 169\u2013178 (2007)"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Strong equilibrium in cost sharing connection games. Games and Economic Behavior\u00a067(1) (2009)","DOI":"10.1016\/j.geb.2008.07.002"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-45061-0_41","volume-title":"Automata, Languages and Programming","author":"E. Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 502\u2013513. Springer, Heidelberg (2003)"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: STOC 2004, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"3","key":"38_CR9","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1287\/opre.1120.1051","volume":"60","author":"M. Feldman","year":"2012","unstructured":"Feldman, M., Tamir, T.: Conflicting congestion effects in resource allocation games. Operations Research\u00a060(3), 529\u2013540 (2012)","journal-title":"Operations Research"},{"key":"38_CR10","unstructured":"Feldman, M., Tamir, T.: Conflicting congestion effects in resource allocation games. Full version, \n                    \n                      http:\/\/www.faculty.idc.ac.il\/tami\/Papers\/BRDcoco.pdf"},{"key":"38_CR11","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\u2013519. Springer, Heidelberg (2002)"},{"issue":"1","key":"38_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00224-009-9205-7","volume":"47","author":"D. Fotakis","year":"2010","unstructured":"Fotakis, D.: Congestion games with linearly independent paths: convergence time and price of anarchy. Theory Comput. Syst.\u00a047(1), 113\u2013136 (2010)","journal-title":"Theory Comput. Syst."},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-10841-9_63","volume-title":"Internet and Network Economics","author":"M. Hoefer","year":"2009","unstructured":"Hoefer, M., Skopalik, A.: Stability and Convergence in Selfish Scheduling with Altruistic Agents. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 616\u2013622. Springer, Heidelberg (2009)"},{"key":"38_CR14","unstructured":"Ieong, S., Mcgrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and Compact: A simple class of congestion games. In: AAAI 2005, pp. 489\u2013494 (2005)"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Johari, R., Kumar, S.: Congestible services and network effects. In: EC 2010, pp. 93\u201394 (2010)","DOI":"10.1145\/1807342.1807356"},{"issue":"2","key":"38_CR16","doi-asserted-by":"publisher","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. Computer Science Review\u00a03(2), 65\u201369 (2009)","journal-title":"Computer Science Review"},{"key":"38_CR17","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":"38_CR18","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, games, and the Internet. In: STOC 2001, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"38_CR19","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":"38_CR20","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 the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"38_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-17572-5_30","volume-title":"Internet and Network Economics","author":"V. Syrgkanis","year":"2010","unstructured":"Syrgkanis, V.: The Complexity of Equilibria in Cost Sharing Games. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 366\u2013377. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35311-6_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,20]],"date-time":"2019-01-20T05:10:21Z","timestamp":1547961021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35311-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353109","9783642353116"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35311-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}