{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:40:40Z","timestamp":1777106440050,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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-09900-y","type":"journal-article","created":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T06:03:19Z","timestamp":1697436199000},"page":"671-690","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hedonic Expertise Games"],"prefix":"10.1007","volume":"92","author":[{"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"}]},{"given":"Berkehan","family":"Ozen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"issue":"8","key":"9900_CR1","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/j.jmateco.2003.12.001","volume":"40","author":"J Alcalde","year":"2004","unstructured":"Alcalde, J., Revilla, P.: Researching with whom? stability and manipulation. J. Math. Econ. 40(8), 869\u2013887 (2004). https:\/\/doi.org\/10.1016\/j.jmateco.2003.12.001","journal-title":"J. Math. Econ."},{"key":"9900_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, H., Brandt, F., Harrenstein, P.: Pareto optimality in coalition formation. Games Econom. Behav. 82, 562\u2013581 (2013)","DOI":"10.1016\/j.geb.2013.08.006"},{"key":"9900_CR3","doi-asserted-by":"publisher","unstructured":"Bachrach, Y., Parkes, D.C., Rosenschein, J.S.: Computing cooperative solution concepts in coalitional skill games. Artificial Intelligence. 204, 1\u201321 (2013). https:\/\/doi.org\/10.1016\/j.artint.2013.07.005","DOI":"10.1016\/j.artint.2013.07.005"},{"issue":"1","key":"9900_CR4","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 Econom. Behav. 49(1), 1\u201330 (2004)","journal-title":"Games Econom. Behav."},{"key":"9900_CR5","doi-asserted-by":"publisher","unstructured":"Banerjee, S., Konishi, H., S\u00f6nmez, T.: Core in a simple coalition formation game. Social Choice and Welfare 18(1), 135\u2013153 (2001). https:\/\/doi.org\/10.1007\/s003550000067","DOI":"10.1007\/s003550000067"},{"key":"9900_CR6","doi-asserted-by":"crossref","unstructured":"Bil\u00f3, V., Monaco, G., Moscardelli, L.: Hedonic games with fixed-size coalitions. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence, pp. 9287\u20139295. AAAI Press (2022). https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/21156","DOI":"10.1609\/aaai.v36i9.21156"},{"issue":"2","key":"9900_CR7","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.O.: The stability of hedonic coalition structures. Games Econom. Behav. 38(2), 201\u2013230 (2002). https:\/\/doi.org\/10.1006\/game.2001.0877","journal-title":"Games Econom. Behav."},{"key":"9900_CR8","doi-asserted-by":"crossref","unstructured":"Brandt, F., Bullinger, M., Lederer, P.: Reaching individually stable coalition structures in hedonic games. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAMAS) (2021 (Forthcoming))","DOI":"10.1609\/aaai.v35i6.16658"},{"key":"9900_CR9","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":"9900_CR10","doi-asserted-by":"publisher","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), LNCS, vol. 11485, pp. 137\u2013148. Springer International Publishing (2019). https:\/\/doi.org\/10.1007\/978-3-030-17402-6_12","DOI":"10.1007\/978-3-030-17402-6_12"},{"key":"9900_CR11","doi-asserted-by":"publisher","unstructured":"Caskurlu, B., Kizilkaya, F.E.: On hedonic games with common ranking property. Ann Math Artif Intell (2023). https:\/\/doi.org\/10.1007\/s10472-023-09892-9","DOI":"10.1007\/s10472-023-09892-9"},{"key":"9900_CR12","doi-asserted-by":"crossref","unstructured":"Caskurlu, B., Kizilkaya, F.E., Ozen, B.: Hedonic expertise games. In: International Symposium on Algorithmic Game Theory, pp. 314\u2013328. Springer (2021)","DOI":"10.1007\/978-3-030-85947-3_21"},{"issue":"4","key":"9900_CR13","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. Internat. J. Game Theory 29(4), 487\u2013494 (2001). https:\/\/doi.org\/10.1007\/s001820000053","journal-title":"Internat. J. Game Theory"},{"key":"9900_CR14","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the 12th Annual IEEE Conference on Computational Complexity (CCC), pp. 262\u2013273. IEEE Computer Society (1997). http:\/\/dl.acm.org\/citation.cfm?id=791230.792302"},{"key":"9900_CR15","doi-asserted-by":"publisher","unstructured":"Darmann, A., Elkind, E., Kurz, S., Lang, J., Schauer, J., Woeginger, G.: Group activity selection problem. In: Proceedings of the 8th International Conference on Internet and Network Economics (WINE), pp. 156\u2013169. Springer-Verlag (2012). https:\/\/doi.org\/10.1007\/978-3-642-35311-6_12","DOI":"10.1007\/978-3-642-35311-6_12"},{"issue":"4","key":"9900_CR16","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 (1980). https:\/\/doi.org\/10.2307\/1912943","journal-title":"Econometrica"},{"key":"9900_CR17","unstructured":"Elkind, E., Wooldridge, M.: Hedonic coalition nets. In: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS, vol. 1, pp. 417\u2013424. International Foundation for Autonomous Agents and Multiagent Systems (2009)"},{"key":"9900_CR18","doi-asserted-by":"crossref","unstructured":"Farrell, J., Scotchmer, S.: Partnerships. The Quarterly Journal of Economics. 103(2),279\u2013297 (1988). http:\/\/www.jstor.org\/stable\/1885113","DOI":"10.2307\/1885113"},{"issue":"4","key":"9900_CR19","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998). https:\/\/doi.org\/10.1145\/285055.285059","journal-title":"J. ACM"},{"key":"9900_CR20","doi-asserted-by":"publisher","unstructured":"Gairing, M., Savani, R.: Computing stable outcomes in hedonic games. In: Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT), pp. 174\u2013185. Springer Berlin Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16170-4_16","DOI":"10.1007\/978-3-642-16170-4_16"},{"issue":"04","key":"9900_CR21","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1142\/S0219198906001144","volume":"08","author":"J Hajdukova","year":"2006","unstructured":"Hajdukova, J.: Coalition formation games: A survey. International Game Theory Review. 08(04), 613\u2013641 (2006). https:\/\/doi.org\/10.1142\/S0219198906001144","journal-title":"International Game Theory Review."},{"issue":"6","key":"9900_CR22","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 largescale multiple agent system. IEEE Trans. Rob. 34(6), 1534\u20131548 (2018). https:\/\/doi.org\/10.1109\/TRO.2018.2858292","journal-title":"IEEE Trans. Rob."},{"key":"9900_CR23","doi-asserted-by":"publisher","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? In: 26th Annual Symposium on Foundations of Computer Science, pp. 39\u201342 (1985). https:\/\/doi.org\/10.1109\/SFCS.1985.31","DOI":"10.1109\/SFCS.1985.31"},{"key":"9900_CR24","doi-asserted-by":"publisher","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u2013i. Math. Program. 14(1), 265\u2013294 (1978). https:\/\/doi.org\/10.1007\/BF01588971","DOI":"10.1007\/BF01588971"},{"key":"9900_CR25","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":"9900_CR26","unstructured":"Tran-Thanh, L., Nguyen, T.D., Rahwan, T., Rogers, A., Jennings, N.R.: An efficient vector-based representation for coalitional games (2013)"},{"key":"9900_CR27","doi-asserted-by":"crossref","unstructured":"Woeginger, G.J.: Core stability in hedonic coalition formation. In: P. van Emde Boas, F.C.A. Groen, G.F. Italiano, J. Nawrocki, H. Sack (eds.) SOFSEM 2013: Theory and Practice of Computer Science, pp. 33\u201350. Springer Berlin Heidelberg (2013)","DOI":"10.1007\/978-3-642-35843-2_4"},{"key":"9900_CR28","doi-asserted-by":"publisher","unstructured":"Wooldridge, M., Dunne, P.E.: On the computational complexity of coalitional resource games. Artificial Intelligence 170(10), 835\u2013871 (2006). https:\/\/doi.org\/10.1016\/j.artint.2006.03.003","DOI":"10.1016\/j.artint.2006.03.003"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-023-09900-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-023-09900-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-023-09900-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T09:15:08Z","timestamp":1717838108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-023-09900-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,16]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["9900"],"URL":"https:\/\/doi.org\/10.1007\/s10472-023-09900-y","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,16]]},"assertion":[{"value":"3 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 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"}}]}}