{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:05Z","timestamp":1750307705907,"version":"3.41.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2008,11]]},"abstract":"<jats:p>Stabilizing distributed systems expect all the component processes to run predefined programs that are externally mandated. In Internet scale systems, this is unrealistic, since each process may have selfish interests and motives related to maximizing its own payoff. This article formulates the problem of selfish stabilization to show how competition blends with cooperation in a stabilizing environment.<\/jats:p>","DOI":"10.1145\/1452001.1452005","type":"journal-article","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T15:32:31Z","timestamp":1228923151000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["An exercise in selfish stabilization"],"prefix":"10.1145","volume":"3","author":[{"given":"Johanne","family":"Cohen","sequence":"first","affiliation":[{"name":"LORIA-CNRS"}]},{"given":"Anurag","family":"Dasgupta","sequence":"additional","affiliation":[{"name":"University of Iowa"}]},{"given":"Sukumar","family":"Ghosh","sequence":"additional","affiliation":[{"name":"University of Iowa"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Pierre and Marie Curie"}]}],"member":"320","published-online":{"date-parts":[[2008,12,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.256850"},{"key":"e_1_2_1_2_1","article-title":"Acceptable points in general cooperative n-person games. In Contributions to the Theory of Games IV","author":"Aumann R.","year":"1959","unstructured":"Aumann , R. 1959 . Acceptable points in general cooperative n-person games. In Contributions to the Theory of Games IV . Annals of Math. Study. Aumann, R. 1959. Acceptable points in general cooperative n-person games. In Contributions to the Theory of Games IV. Annals of Math. Study.","journal-title":"Annals of Math. Study."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1127777.1127792"},{"key":"e_1_2_1_4_1","volume-title":"Eds. Lecture Notes in Computer Science","volume":"2704","author":"Cobb J. A.","unstructured":"Cobb , J. A. , Gouda , M. G. , and Musunuri , R . 2003. A stabilizing solution to the stable path problem. In Self-Stabilizing Systems, S.-T. Huang and T. Herman , Eds. Lecture Notes in Computer Science , vol. 2704 . Springer, Berlin, Heidelberg, Germany. 169--183. Cobb, J. A., Gouda, M. G., and Musunuri, R. 2003. A stabilizing solution to the stable path problem. In Self-Stabilizing Systems, S.-T. Huang and T. Herman, Eds. Lecture Notes in Computer Science, vol. 2704. Springer, Berlin, Heidelberg, Germany. 169--183."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Dolev S. 2000. Self-Stabilization. MIT Press.   Dolev S. 2000. Self-Stabilization. MIT Press.","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Dolev S. Schiller E. and Spirakis P. 2006. Game authority: for robust distributed selfish-computer systems. Tech. rep. DELIS. http:\/\/delis.upb.de\/docs\/.  Dolev S. Schiller E. and Spirakis P. 2006. Game authority: for robust distributed selfish-computer systems. Tech. rep. DELIS. http:\/\/delis.upb.de\/docs\/.","DOI":"10.1145\/1281100.1281171"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.993304"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 1st World Congress of the Game Theory Society (GAMES).","author":"Halpern J.","year":"2000","unstructured":"Halpern , J. 2000 . A computer scientist looks at game theory . In Proceedings of the 1st World Congress of the Game Theory Society (GAMES). Halpern, J. 2000. A computer scientist looks at game theory. In Proceedings of the 1st World Congress of the Game Theory Society (GAMES)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11821069_45"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90264-V"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146394"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11600930_98"},{"key":"e_1_2_1_14_1","first-page":"1","article-title":"Congestion games with player-specific payoff functions. Games Eco","volume":"13","author":"Milchtaich I.","year":"1996","unstructured":"Milchtaich , I. 1996 . Congestion games with player-specific payoff functions. Games Eco . Behav. 13 , 1 (March), 111--124. Milchtaich, I. 1996. Congestion games with player-specific payoff functions. Games Eco. Behav. 13, 1 (March), 111--124.","journal-title":"Behav."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146403"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146391"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.36.1.48"},{"volume-title":"Models of Bounded Rationality: Vols. 1 and 2","author":"Simon H.","key":"e_1_2_1_18_1","unstructured":"Simon , H. 1982. Models of Bounded Rationality: Vols. 1 and 2 . MIT Press . Simon, H. 1982. Models of Bounded Rationality: Vols. 1 and 2. MIT Press."}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1452001.1452005","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1452001.1452005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:06Z","timestamp":1750253406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1452001.1452005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["10.1145\/1452001.1452005"],"URL":"https:\/\/doi.org\/10.1145\/1452001.1452005","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"type":"print","value":"1556-4665"},{"type":"electronic","value":"1556-4703"}],"subject":[],"published":{"date-parts":[[2008,11]]},"assertion":[{"value":"2007-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-12-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}