{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:57:15Z","timestamp":1725749835486},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319016030"},{"type":"electronic","value":"9783319016047"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-01604-7_5","type":"book-chapter","created":{"date-parts":[[2013,9,23]],"date-time":"2013-09-23T12:37:45Z","timestamp":1379939865000},"page":"45-54","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Selfish Algorithms for the Max-Cut Game"],"prefix":"10.1007","author":[{"given":"D.","family":"Auger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Coucheney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Rodier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,24]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Adolphs C, Berenbrink P (2012) Distributed selfish load balancing with weights and speeds. In: Proceedings of the 2012 ACM symposium on principles of, distributed computing, pp 135\u2013144","DOI":"10.1145\/2332432.2332460"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s00453-010-9482-1","volume":"62","author":"P Berenbrink","year":"2012","unstructured":"Berenbrink P, Friedetzky T, Hajirasouliha I, Hu Z (2012) Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks. Algorithmica 62:767\u2013786","journal-title":"Algorithmica"},{"key":"5_CR3","unstructured":"Chien S, Sinclair A (2007) Convergence to approximate nash equilibria in congestion games. In: Proceedings of SODA, pp 169\u2013178"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2012.02.033","volume":"438","author":"G Christodoulou","year":"2012","unstructured":"Christodoulou G, Mirrokni V, Sidiropoulos A (2012) Convergence and approximation in potential games. Theor Comput Sci 438:13\u201327","journal-title":"Theor Comput Sci"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/1273340.1273348","volume":"3","author":"E Even-Dar","year":"2007","unstructured":"Even-Dar E, Kesselman A, Mansour Y (2007) Convergence time to nash equilibrium in load balancing. ACM Trans Algorithms 3(3):32","journal-title":"ACM Trans Algorithms"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Fabrikant A, Papadimitriou C, Talwar K (2004) The complexity of pure nash equilibria. In: Proceedings of STOCS, ACM Press, pp 604\u2013612","DOI":"10.1145\/1007352.1007445"},{"issue":"6","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M Goemans","year":"1995","unstructured":"Goemans M, Williamson D (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42(6):1115\u20131145","journal-title":"J ACM"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Goldberg P (2004) Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. In: Proceedings of the twenty-third annual ACM symposium on principles of distributed computing, pp 131\u2013140","DOI":"10.1145\/1011767.1011787"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Gourvs L, Monnot J (2010) The max k-cut game and its strong equilibria. In: Proceedings of TAMC, Springer, pp 234\u2013246","DOI":"10.1007\/978-3-642-13562-0_22"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Khot S, Kindler G, Mossel E (2004) Optimal inapproximability results for max-cut and other 2-variable CSPs. In: Proceedings of FOCS, pp 146\u2013154","DOI":"10.1109\/FOCS.2004.49"},{"key":"5_CR11","volume-title":"Algorithm design","author":"J Kleinberg","year":"2005","unstructured":"Kleinberg J, Tardos E (2005) Algorithm design. Addison-Wesley Longman Publishing Co., Boston"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer D, Shapley LS (1996) Potential games. Games Econ Behav 14(1):124\u2013143","journal-title":"Games Econ Behav"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal RW (1973) A class of games possessing pure-strategy Nash equilibria. Int J Game Theory 2:65\u201367","journal-title":"Int J Game Theory"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"A Schaffer","year":"1991","unstructured":"Schaffer A, Yannakakis M (1991) Simple local search problems that are hard to solve. SIAM J Comput 20(1):56\u201387","journal-title":"SIAM J Comput"}],"container-title":["Lecture Notes in Electrical Engineering","Information Sciences and Systems 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-01604-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,11]],"date-time":"2018-10-11T05:30:46Z","timestamp":1539235846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-01604-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319016030","9783319016047"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-01604-7_5","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2013]]}}}