{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:10:10Z","timestamp":1750227010494,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T00:00:00Z","timestamp":1447891200000},"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":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2015,11,19]]},"abstract":"<jats:p>In this short paper, we show two new algorithms for finding stable structures in ordinal coalition potential games. The first one is anytime and enumerative. It performs on a graph. The second one is a modified Deferred Acceptance Algorithm (DAA) using counter-proposals. It finds a many-to-one matching. We illustrate with the example of video caching from a content creator's servers to a service provider's servers.<\/jats:p>","DOI":"10.1145\/2847220.2847244","type":"journal-article","created":{"date-parts":[[2015,11,20]],"date-time":"2015-11-20T13:58:34Z","timestamp":1448027914000},"page":"72-75","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Core Stable Algorithms for Coalition Games with Complementarities and Peer Effects"],"prefix":"10.1145","volume":"43","author":[{"given":"Mikael","family":"Touati","sequence":"first","affiliation":[{"name":"Orange Labs, Issy-Les-Moulineaux, France"}]},{"given":"Rachid","family":"El-Azouzi","sequence":"additional","affiliation":[{"name":"University of Avignon, Avignon, France"}]},{"given":"Marceau","family":"Coupechoux","sequence":"additional","affiliation":[{"name":"Telecom ParisTech, Paris, France"}]},{"given":"Eitan","family":"Altman","sequence":"additional","affiliation":[{"name":"INRIA Sophia Antipolis, Sophia Antipolis, France"}]},{"given":"Jean-Marc","family":"Kelif","sequence":"additional","affiliation":[{"name":"Orange Labs, Issy-Les-Moulineaux, France"}]}],"member":"320","published-online":{"date-parts":[[2015,11,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_2_1_2_1","volume-title":"Theories of Coalition Formation","author":"Rapoportand A.","year":"1984","unstructured":"A. Rapoportand and J.P.Kahan , Theories of Coalition Formation . Lawrence Erlbaum Associates , 1984 . A. Rapoportand and J.P.Kahan, Theories of Coalition Formation. Lawrence Erlbaum Associates, 1984."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-Sided Matching A Study In Game-Theoritic Modeling and Analysis","author":"Roth A.E.","year":"1990","unstructured":"A.E. Roth and M. A.O. Sotomayor , Two-Sided Matching A Study In Game-Theoritic Modeling and Analysis , Econometric Society Monographs, No . 18, Cambridge University Press , 1990 . A.E. Roth and M.A.O. Sotomayor, Two-Sided Matching A Study In Game-Theoritic Modeling and Analysis, Econometric Society Monographs, No. 18, Cambridge University Press, 1990."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00036-3"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001820000053"},{"key":"e_1_2_1_6_1","first-page":"46","volume-title":"A solution to matching with preferences over colleagues","author":"Echenique F.","year":"2007","unstructured":"F. Echenique and M.B. Yenmez , A solution to matching with preferences over colleagues , Volume 59 , Issue 1, pp. 46 -- 71 , April 2007 . F. Echenique and M.B. Yenmez, A solution to matching with preferences over colleagues, Volume 59, Issue 1, pp. 46--71, April 2007."},{"key":"e_1_2_1_7_1","first-page":"1417","volume-title":"AAMAS","author":"Rahwan T.","year":"2008","unstructured":"T. Rahwan and N.R. Jennings , An improved dynamic programming algorithm for coalition structure generation , AAMAS , pp. 1417 -- 1420 , 2008 . T. Rahwan and N.R. Jennings, An improved dynamic programming algorithm for coalition structure generation, AAMAS, pp. 1417--1420, 2008."},{"volume-title":"Econometrica","author":"Pycia M.","key":"e_1_2_1_9_1","unstructured":"M. Pycia , Stability and Preference Alignment in Matching and Coalition Formation , Econometrica , Vol. 80 , No. 1, pp 323--362, January 2012. M. Pycia, Stability and Preference Alignment in Matching and Coalition Formation, Econometrica, Vol. 80, No. 1, pp 323--362, January 2012."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2847220.2847244","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2847220.2847244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:23Z","timestamp":1750225703000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2847220.2847244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,19]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11,19]]}},"alternative-id":["10.1145\/2847220.2847244"],"URL":"https:\/\/doi.org\/10.1145\/2847220.2847244","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2015,11,19]]},"assertion":[{"value":"2015-11-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}