{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:51Z","timestamp":1740123831992,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T00:00:00Z","timestamp":1692748800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T00:00:00Z","timestamp":1692748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00dcBITAK","doi-asserted-by":"crossref","award":["118E126"],"award-info":[{"award-number":["118E126"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10472-023-09892-9","type":"journal-article","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T12:02:23Z","timestamp":1692792143000},"page":"581-599","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On hedonic games with common ranking property"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4647-205X","authenticated-orcid":false,"given":"Bugra","family":"Caskurlu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatih Erdem","family":"Kizilkaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,23]]},"reference":[{"issue":"4","key":"9892_CR1","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9892_CR2","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/3327970","volume":"7","author":"H Aziz","year":"2019","unstructured":"Aziz, H., Brandl, F., Brandt, F., Harrenstein, P., Olsen, M., Peters, D.: Fractional hedonic games. ACM Trans. Econ. Comput. 7(2), 6:1-6:29 (2019)","journal-title":"ACM Trans. Econ. Comput."},{"key":"9892_CR3","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/j.geb.2013.08.006","volume":"82","author":"H Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., Harrenstein, P.: Pareto optimality in coalition formation. Games Econ. Behav. 82, 562\u2013581 (2013)","journal-title":"Games Econ. Behav."},{"key":"9892_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.artint.2012.09.006","volume":"195","author":"H Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., Seedig, H.G.: Computing desirable partitions in additively separable hedonic games. Artif. Intell. 195, 316\u2013334 (2013)","journal-title":"Artif. Intell."},{"issue":"1","key":"9892_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.geb.2003.10.003","volume":"49","author":"C Ballester","year":"2004","unstructured":"Ballester, C.: NP-completeness in hedonic games. Games and Economic Behavior 49(1), 1\u201330 (2004)","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"9892_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s003550000067","volume":"18","author":"S Banerjee","year":"2001","unstructured":"Banerjee, S., Konishi, H., S\u00f6nmez, T.: Core in a simple coalition formation game. Soc Choice Welf 18(1), 135\u2013153 (2001)","journal-title":"Soc Choice Welf"},{"issue":"1","key":"9892_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/S0097539792228289","volume":"23","author":"M Bellare","year":"1994","unstructured":"Bellare, M., Goldwasser, S.: The complexity of decision versus search. SIAM J. Comput. 23(1), 97\u2013119 (1994)","journal-title":"SIAM J. Comput."},{"key":"9892_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1613\/jair.1.11211","volume":"62","author":"V Bil\u00f2","year":"2018","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Monaco, G., Moscardelli, L.: Nash stable outcomes in fractional hedonic games: existence, efficiency and computation. J. Artif. Intell. Res. 62, 315\u2013371 (2018)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"9892_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00182-010-0237-7","volume":"40","author":"F Bloch","year":"2011","unstructured":"Bloch, F., Diamantoudi, E.: Noncooperative formation of coalitions in hedonic games. Int. J. Game Theory 40(2), 263\u2013280 (2011)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"9892_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/game.2001.0877","volume":"38","author":"A Bogomolnaia","year":"2002","unstructured":"Bogomolnaia, A., Jackson, M.: The stability of hedonic coalition structures. Games Econ. Behav. 38(2), 201\u2013230 (2002)","journal-title":"Games Econ. Behav."},{"key":"9892_CR11","doi-asserted-by":"crossref","unstructured":"Brandt, F., Bullinger, M., Wilczynski, A.: Reaching individually stable coalition structures in hedonic games. In: Proceedings of the 35th Conference on Artificial Intelligence(AAAI), vol.\u00a035, pp. 5211\u20135218 (2021)","DOI":"10.1609\/aaai.v35i6.16658"},{"key":"9892_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of computational social choice","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of computational social choice. Cambridge University Press, USA (2016)"},{"key":"9892_CR13","unstructured":"Carosi, R., Monaco, G., Moscardelli, L.: Local core stability in simple symmetric fractional hedonic games. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pp. 574\u2013582 (2019)"},{"key":"9892_CR14","doi-asserted-by":"crossref","unstructured":"Caskurlu, B., Kizilkaya, F.E.: On hedonic games with common ranking property. In: Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC), vol. 11485, pp. 137\u2013148 (2019)","DOI":"10.1007\/978-3-030-17402-6_12"},{"key":"9892_CR15","doi-asserted-by":"crossref","unstructured":"Caskurlu, B., Kizilkaya, F.E., Ozen, B.: Hedonic expertise games. In: Proceedings of the 14th International Symposium on Algorithmic Game Theory (SAGT), Lecture Notes in Computer Science, vol. 12885, pp. 314\u2013328 (2021)","DOI":"10.1007\/978-3-030-85947-3_21"},{"key":"9892_CR16","doi-asserted-by":"crossref","unstructured":"Cechl\u00e1rov\u00e1, K., Hajdukov\u00e1, J.: Stable partitions with W-preferences. Discret. Appl. Math. 138(3), 333\u2013347 (2004)","DOI":"10.1016\/S0166-218X(03)00464-5"},{"issue":"3","key":"9892_CR17","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s001820200124","volume":"31","author":"K Cechl\u00e1rov\u00e1","year":"2003","unstructured":"Cechl\u00e1rov\u00e1, K., Hajdukov\u00e1, J.: Computational complexity of stable partitions with B-preferences. Int. J. Game Theory 31(3), 353\u2013364 (2003)","journal-title":"Int. J. Game Theory"},{"issue":"4","key":"9892_CR18","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s001820000053","volume":"29","author":"K Cechl\u00e1rov\u00e1","year":"2001","unstructured":"Cechl\u00e1rov\u00e1, K., Romero-Medina, A.: Stability in coalition formation games. Int. J. Game Theory 29(4), 487\u2013494 (2001)","journal-title":"Int. J. Game Theory"},{"key":"9892_CR19","doi-asserted-by":"crossref","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the 12th Annual IEEE Conference on Computational Complexity (CCC), pp. 262 (1997)","DOI":"10.1109\/CCC.1997.612321"},{"issue":"2","key":"9892_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X Deng","year":"1994","unstructured":"Deng, X., Papadimitriou, C.H.: On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2), 257\u2013266 (1994)","journal-title":"Math. Oper. Res."},{"issue":"12","key":"9892_CR21","first-page":"1","volume":"4","author":"D Dimitrov","year":"2006","unstructured":"Dimitrov, D.: Top coalitions, common rankings, and semistrict core stability. Econ. Bull. 4(12), 1\u20136 (2006)","journal-title":"Econ. Bull."},{"issue":"4","key":"9892_CR22","doi-asserted-by":"publisher","first-page":"987","DOI":"10.2307\/1912943","volume":"48","author":"JH Dr\u00e8ze","year":"1980","unstructured":"Dr\u00e8ze, J.H., Greenberg, J.: Hedonic coalitions: optimality and stability. Econometrica 48(4), 987\u20131003 (1980)","journal-title":"Econometrica"},{"issue":"2","key":"9892_CR23","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","volume":"7","author":"ME Dyer","year":"1986","unstructured":"Dyer, M.E., Frieze, A.M.: Planar 3DM is NP-complete. J. Algorithm. 7(2), 174\u2013184 (1986)","journal-title":"J. Algorithm."},{"key":"9892_CR24","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, Trees, and Flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"9892_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103357","volume":"288","author":"E Elkind","year":"2020","unstructured":"Elkind, E., Fanelli, A., Flammini, M.: Price of pareto optimality in hedonic games. Artif. Intell. 288, 103357 (2020)","journal-title":"Artif. Intell."},{"key":"9892_CR26","unstructured":"Elkind, E., Wooldridge, M.: Hedonic coalition nets. In: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), vol.\u00a01, pp. 417\u2013424 (2009)"},{"key":"9892_CR27","doi-asserted-by":"crossref","unstructured":"Fanelli, A., Monaco, G., Moscardelli, L.: Relaxed core stability in fractional hedonic games. In: The 13th International Joint Conference on Artificial Intelligence (IJCAI), pp. 182\u2013188 (2021)","DOI":"10.24963\/ijcai.2021\/26"},{"issue":"2","key":"9892_CR28","doi-asserted-by":"publisher","first-page":"279","DOI":"10.2307\/1885113","volume":"103","author":"J Farrell","year":"1988","unstructured":"Farrell, J., Scotchmer, S.: Partnerships. Q. J. Econ. 103(2), 279\u2013297 (1988)","journal-title":"Q. J. Econ."},{"key":"9892_CR29","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1613\/jair.1.12107","volume":"70","author":"M Flammini","year":"2021","unstructured":"Flammini, M., Kodric, B., Monaco, G., Zhang, Q.: Strategyproof mechanisms for additively separable and fractional hedonic games. J. Artif. Intell. Res. 70, 1253\u20131279 (2021)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"9892_CR30","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1287\/moor.2018.0960","volume":"44","author":"M Gairing","year":"2019","unstructured":"Gairing, M., Savani, R.: Computing stable outcomes in symmetric additively separable hedonic games. Math. Oper. Res. 44(3), 1101\u20131121 (2019)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9892_CR31","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"issue":"4","key":"9892_CR32","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1142\/S0219198906001144","volume":"8","author":"J Hajdukova","year":"2006","unstructured":"Hajdukova, J.: Coalition formation games: A survey. Int. Game Theory Rev. 8(4), 613\u2013641 (2006)","journal-title":"Int. Game Theory Rev."},{"issue":"4","key":"9892_CR33","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"RW Irving","year":"1985","unstructured":"Irving, R.W.: An efficient algorithm for the Stable roommates problem. J. Algorithm. 6(4), 577\u2013595 (1985)","journal-title":"J. Algorithm."},{"issue":"6","key":"9892_CR34","doi-asserted-by":"publisher","first-page":"1534","DOI":"10.1109\/TRO.2018.2858292","volume":"34","author":"I Jang","year":"2018","unstructured":"Jang, I., Shin, H.S., Tsourdos, A.: Anonymous hedonic game for task allocation in a large-scale multiple agent system. IEEE Trans. Robot. 34(6), 1534\u20131548 (2018)","journal-title":"IEEE Trans. Robot."},{"key":"9892_CR35","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations: Proceedings of a Symposium on the Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"2","key":"9892_CR36","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. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Worst-case equilibria. Comput. Sci. Rev."},{"key":"9892_CR37","unstructured":"Larson, A.: What is a partnership? Online: https:\/\/www.expertlaw.com\/library\/business\/partnership.html (2018)"},{"key":"9892_CR38","doi-asserted-by":"crossref","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences, Series on Theoretical Computer Science, vol.\u00a02. WorldScientific (2013)","DOI":"10.1142\/8591"},{"key":"9892_CR39","doi-asserted-by":"crossref","unstructured":"Monaco, G., Moscardelli, L., Velaj, Y.: Stable outcomes in modified fractional hedonic games. Auton. Agent. Multi-Agent. Syst. 34(1) (2020)","DOI":"10.1007\/s10458-019-09431-z"},{"issue":"1","key":"9892_CR40","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":"Potential games. Games Econ. Behav."},{"volume-title":"Algorithmic Game Theory","year":"2007","key":"9892_CR41","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"issue":"4","key":"9892_CR42","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s00224-009-9176-8","volume":"45","author":"M Olsen","year":"2009","unstructured":"Olsen, M.: Nash stability in additively separable hedonic games and community structures. Theory Comput. Syst. 45(4), 917\u2013925 (2009)","journal-title":"Theory Comput. Syst."},{"key":"9892_CR43","unstructured":"Peters, D., Elkind, E.: Simple causes of complexity in hedonic games. In: The 24th International Joint Conference on Artificial Intelligence (IJCAI), pp. 617\u2013623 (2015)"},{"key":"9892_CR44","doi-asserted-by":"crossref","unstructured":"Shenoy, P.P.: On coalition formation: A game-theoretical approach. Int. J. Game Theory 8(3) (1979)","DOI":"10.1007\/BF01770064"},{"issue":"3","key":"9892_CR45","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.ejor.2009.09.004","volume":"203","author":"SC Sung","year":"2010","unstructured":"Sung, S.C., Dimitrov, D.: Computational complexity in additive hedonic games. Eur. J. Oper. Res. 203(3), 635\u2013639 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9892_CR46","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: The 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-023-09892-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-023-09892-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-023-09892-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T17:02:28Z","timestamp":1729962148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-023-09892-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,23]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["9892"],"URL":"https:\/\/doi.org\/10.1007\/s10472-023-09892-9","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2023,8,23]]},"assertion":[{"value":"10 August 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Financial\/Non-financial Interests"}}]}}