{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:13:42Z","timestamp":1761621222480,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,7,19]],"date-time":"2015-07-19T00:00:00Z","timestamp":1437264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,7,19]],"date-time":"2015-07-19T00:00:00Z","timestamp":1437264000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0914782, 1101495 and 1017932"],"award-info":[{"award-number":["0914782, 1101495 and 1017932"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00224-015-9646-0","type":"journal-article","created":{"date-parts":[[2015,7,18]],"date-time":"2015-07-18T00:39:25Z","timestamp":1437179965000},"page":"440-475","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Assignment Games with Conflicts: Robust Price of Anarchy and Convergence Results via Semi-Smoothness"],"prefix":"10.1007","volume":"59","author":[{"given":"Elliot","family":"Anshelevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Postl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Wexler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,19]]},"reference":[{"key":"9646_CR1","unstructured":"Augustine, J., Chen, N., Elkind, E., Fanelli, A., Gravin, N., Shiryaev, D.: Dynamics of profit-sharing games. In: IJCAI, pp. 37\u201342 (2011)"},{"key":"9646_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A., Mirrkoni, V.S., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: Proceedings of EC, pp. 264\u2013273 (2008)","DOI":"10.1145\/1386790.1386832"},{"key":"9646_CR3","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Syrgkanis, V., Tardos, \u00c9., Vojnovi\u0107, M.: Strong Price of Anarchy, Utility Games, and Coalitional Dynamics. In: Proceedings of SAGT (2014)","DOI":"10.1007\/978-3-662-44803-8_19"},{"key":"9646_CR4","doi-asserted-by":"crossref","unstructured":"Bhalgat, A., Chakraborty, T., Khanna, S.: Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. In: Proceedings of EC, pp. 73\u201382 (2010)","DOI":"10.1145\/1807342.1807353"},{"key":"9646_CR5","doi-asserted-by":"crossref","unstructured":"Blum, A., Hajiaghayi, M., Ligett, K., Roth, A.: Regret minimization and the price of total anarchy. In: Proceedings of STOC, pp. 373\u2013382 (2008)","DOI":"10.1145\/1374376.1374430"},{"key":"9646_CR6","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Flammini, M., Kaklamansis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Proceedings of ICALP, pp. 311\u2013322 (2006)","DOI":"10.1007\/11786986_28"},{"key":"9646_CR7","unstructured":"Caragiannis, I., Kaklamansis, C., Kanellopoulos, P., Kyropoulou, M., Lucier, B., Leme, R.P., Tardos, \u00c9.: Bounding the inefficiency of outcomes in generalized second price auctions. J. Econ. Theory 156, 343\u2013388 (2015)"},{"key":"9646_CR8","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of STOC, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"9646_CR9","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. In: Proceedings of STACS, pp. 349\u2013360 (2006)","DOI":"10.1007\/11672142_28"},{"key":"9646_CR10","doi-asserted-by":"crossref","unstructured":"Fanelli, A., Flammini, M., Moscardelli, L.: The speed of convergence in congestion games under best-response dynamics. In: Proceedings of ICALP, pp. 796\u2013807 (2008)","DOI":"10.1007\/978-3-540-70575-8_65"},{"key":"9646_CR11","doi-asserted-by":"crossref","unstructured":"Fanelli, A., Moscardelli, L.: On best response dynamics in weighted congestion games with polynomial delays. In: Proceedings of WINE, pp. 55\u201366 (2009)","DOI":"10.1007\/978-3-642-10841-9_7"},{"key":"9646_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, M., Lewin-Eytan, L., Naor, J.S.: Hedonic clustering games. In: Proceedings of SPAA, pp. 267\u2013276 (2012)","DOI":"10.1145\/2312005.2312053"},{"key":"9646_CR13","doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Li, L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in ad-hoc networks. In: Proceedings of JSAC, vol. 24, no. 5, pp. 1020\u20131033 (2006)","DOI":"10.1109\/JSAC.2006.872884"},{"key":"9646_CR14","doi-asserted-by":"crossref","unstructured":"Gourv\u00e8s, L., Monnot, J.: On strong equilibria in the max cut game. In: Proceedings of WINE, pp. 608\u2013615 (2009)","DOI":"10.1007\/978-3-642-10841-9_62"},{"key":"9646_CR15","doi-asserted-by":"crossref","unstructured":"Gourv\u00e8s, L., Monnot, J.: The max k-cut game and its strong equilibria. In: Proceedings of TAMC, pp. 234\u2013246 (2010)","DOI":"10.1007\/978-3-642-13562-0_22"},{"key":"9646_CR16","unstructured":"Hoefer, M.: Cost Sharing and Clustering under Distributed Competition. PhD Thesis, Universit\u00e4t Konstanz (2007)"},{"issue":"2","key":"9646_CR17","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1257\/aer.97.2.92","volume":"97","author":"MO Jackson","year":"2007","unstructured":"Jackson, M.O., Yariv, L.: Diffusion of behavior and equilibrium properties in network games. Am. Econ. Rev. 97(2), 92\u201398 (2007)","journal-title":"Am. Econ. Rev."},{"key":"9646_CR18","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD \u201903, pp 137\u2013146"},{"key":"9646_CR19","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Cascading behavior in networks: algorithmic and economic issues. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V. (eds.) Algorithmic Game Theory, pp. 613\u2013632 (2007)","DOI":"10.1017\/CBO9780511800481.026"},{"key":"9646_CR20","doi-asserted-by":"crossref","unstructured":"Kothari, A., Suri, S., T\u00f3th, C.D., Zhou, Y.: Congestion games, load balancing, and the price of anarchy. In: Proceedings of CAAN, pp. 13\u201327 (2004)","DOI":"10.1007\/11527954_3"},{"key":"9646_CR21","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proceedings of STACS, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9646_CR22","doi-asserted-by":"crossref","unstructured":"Lucier, B., Leme, R.P.: GSP auctions with correlated types. In: Proceedings of EC, pp. 71\u201380 (2011)","DOI":"10.1145\/1993574.1993587"},{"key":"9646_CR23","doi-asserted-by":"crossref","unstructured":"Mirrokni, V.S., Vetta, A.: Convergence issues in competitive games. In: Proceedings of RANDOM-APPROX, pp. 183\u2013194 (2014)","DOI":"10.1007\/978-3-540-27821-4_17"},{"issue":"1","key":"9646_CR24","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 Econ. Behav. 14(1), 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"9646_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1111\/1467-937X.00121","volume":"67","author":"S Morris","year":"2000","unstructured":"Morris, S.: Contagion. Rev. Econ. Stud. 67(1), 57\u201378 (2000)","journal-title":"Rev. Econ. Stud."},{"key":"9646_CR26","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V. (eds.): Algorithmic Game Theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"9646_CR27","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of STOC, pp. 513\u2013522 (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"9646_CR28","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Schoppmann, F.: Local smoothness and the price of anarchy in atomic splittable congestion games. In: Proceedings of SODA, pp. 255\u2013267 (2011)","DOI":"10.1137\/1.9781611973082.22"},{"issue":"1","key":"9646_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S Suri","year":"2007","unstructured":"Suri, S., T\u00f3th, C.D., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica 47(1), 79\u201396 (2007)","journal-title":"Algorithmica"},{"key":"9646_CR30","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: Selfish load balancing. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V. (eds.) Algorithmic Game Theory, pp. 517\u2013542 (2007)","DOI":"10.1017\/CBO9780511800481.022"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9646-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9646-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9646-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9646-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T05:36:20Z","timestamp":1589693780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9646-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,19]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9646"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9646-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2015,7,19]]},"assertion":[{"value":"19 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}