{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:47Z","timestamp":1771036367464,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T00:00:00Z","timestamp":1751932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T00:00:00Z","timestamp":1751932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP19K21537"],"award-info":[{"award-number":["JP19K21537"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJCS24K2"],"award-info":[{"award-number":["JPMJCS24K2"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10458-025-09711-x","type":"journal-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T07:18:07Z","timestamp":1751959087000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hedonic seat arrangement problems"],"prefix":"10.1007","volume":"39","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Tesshu","family":"Hanaka","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Jaffke","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]},{"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[]},{"given":"Tom C.","family":"van der Zanden","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,8]]},"reference":[{"key":"9711_CR1","doi-asserted-by":"publisher","unstructured":"Agarwal, A., Elkind, E., Gan, J., Igarashi, A., Suksompong, W., Voudouris, A. A. (2021). Schelling games on graphs. Artificial Intelligence,301, Article 103576. https:\/\/doi.org\/10.1016\/j.artint.2021.103576","DOI":"10.1016\/j.artint.2021.103576"},{"issue":"1","key":"9711_CR2","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02716626","volume":"1","author":"Jos\u00e9 Alcalde","year":"1994","unstructured":"Alcalde, Jos\u00e9. (1994). Exchange-proofness or divorce-proofness? Stability in one-sided matching markets. Economic Design,1(1), 275\u2013287. https:\/\/doi.org\/10.1007\/BF02716626","journal-title":"Economic Design"},{"key":"9711_CR3","doi-asserted-by":"publisher","unstructured":"Aziz, H., Brandl, F., Brandt, F., Harrenstein, P., Olsen, M., Peters, D., (2019). Fractional hedonic games. ACM Transactions on Economics and Computation, 7(2), 6:1\u20136:29. https:\/\/doi.org\/10.1145\/3327970.","DOI":"10.1145\/3327970"},{"key":"9711_CR4","doi-asserted-by":"publisher","unstructured":"Aziz, H., Brandt, F., Seedig, H\u00a0G., (2013). Computing desirable partitions in additively separable hedonic games. Artificial Intelligence, 195, 316\u2013334. https:\/\/doi.org\/10.1016\/J.ARTINT.2012.09.006.","DOI":"10.1016\/J.ARTINT.2012.09.006"},{"key":"9711_CR5","unstructured":"Aziz, H., Goldwaser, A. (2017). Coalitional exchange stable matchings in marriage and roommate markets. In: Larson, K., Winikoff, M., Das, S., Durfee, E\u00a0H., editors, Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, S\u00e3o Paulo, Brazil, 8-12 May, 2017, pp. 1475\u20131477. ACM, http:\/\/dl.acm.org\/citation.cfm?id=3091334."},{"key":"9711_CR6","doi-asserted-by":"publisher","unstructured":"Berriaud, D., Constantinescu, A., Wattenhofer R. (2023). Stable dinner party seating arrangements. In: Garg, J., Klimm, M., Kong, Y., editors, Proceedings of the 19th International Conference on Web and Internet Economics, WINE 2023, Shanghai, China, 4-8 December, 2023, Proceedings, volume 14413 of Lecture Notes in Computer Science, pp. 3\u201320. Springer. https:\/\/doi.org\/10.1007\/978-3-031-48974-7_1.","DOI":"10.1007\/978-3-031-48974-7_1"},{"key":"9711_CR7","doi-asserted-by":"publisher","unstructured":"Bertsimas, D., & F., Vivek F., Trichakis, N. (2011). The price of fairness. Operations Research,59(1), 17\u201331. https:\/\/doi.org\/10.1287\/OPRE.1100.0865","DOI":"10.1287\/OPRE.1100.0865"},{"key":"9711_CR8","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., Bil\u00f2, V., Lenzner, P., Molitor L. (2022). Topological influence and locality in swap schelling games. Autonomous Agents and Multi-Agent System, 36(2), 47. https:\/\/doi.org\/10.1007\/s10458-022-09573-7","DOI":"10.1007\/s10458-022-09573-7"},{"key":"9711_CR9","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Monaco, G., Moscardelli, L. (2018). Nash stable outcomes in fractional hedonic games: Existence, efficiency and computation. Journal of Artificial Intelligence Research, 62, 315\u2013371. https:\/\/doi.org\/10.1613\/JAIR.1.11211","DOI":"10.1613\/JAIR.1.11211"},{"key":"9711_CR10","doi-asserted-by":"publisher","unstructured":"Bodlaender, H\u00a0L., Hanaka, T., Kobayashi, Y., Kobayashi, Y., Okamoto, Y., Otachi, Y., van\u00a0der Zanden T\u00a0C. (2020) Subgraph isomorphism on graph classes that exclude a substructure. Algorithmica, 82(12), 3566\u20133587. https:\/\/doi.org\/10.1007\/S00453-020-00737-Z","DOI":"10.1007\/S00453-020-00737-Z"},{"key":"9711_CR11","doi-asserted-by":"publisher","unstructured":"Bogomolnaia, A., Jackson M\u00a0O. (2002). The stability of hedonic coalition structures. Games Economic Behavior, 38(2), 201\u2013230. https:\/\/doi.org\/10.1006\/GAME.2001.0877","DOI":"10.1006\/GAME.2001.0877"},{"key":"9711_CR12","doi-asserted-by":"publisher","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A\u00a0D. (2016) editors. Handbook of Computational Social Choice. Cambridge University Press, https:\/\/doi.org\/10.1017\/CBO9781107446984.","DOI":"10.1017\/CBO9781107446984."},{"key":"9711_CR13","unstructured":"Br\u00e2nzei, S., Larson, K. (2009) Coalitional affinity games and the stability gap. In Craig Boutilier, editor, IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11-17 July, 2009, pp. 79\u201384, http:\/\/ijcai.org\/Proceedings\/09\/Papers\/024.pdf."},{"key":"9711_CR14","doi-asserted-by":"publisher","unstructured":"Br\u00e2nzei, S., Larson, K. (2011). Social distance games. In Toby Walsh, editor, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, Barcelona, Catalonia, Spain, 16-22 July, 2011, pp. 91\u201396. IJCAI\/AAAI, https:\/\/doi.org\/10.5591\/978-1-57735-516-8\/IJCAI11-027","DOI":"10.5591\/978-1-57735-516-8\/IJCAI11-027"},{"key":"9711_CR15","doi-asserted-by":"publisher","unstructured":"Bullinger, M., Suksompong, W. (2024). Topological distance games. Theoretical Computer Science, 981 114238, https:\/\/doi.org\/10.1016\/J.TCS.2023.114238","DOI":"10.1016\/J.TCS.2023.114238"},{"key":"9711_CR16","doi-asserted-by":"publisher","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou M. (2012). The efficiency of fair division. Theory of Computing Systems, 50(4), 589\u2013610, https:\/\/doi.org\/10.1007\/S00224-011-9359-Y.","DOI":"10.1007\/S00224-011-9359-Y"},{"key":"9711_CR17","doi-asserted-by":"publisher","unstructured":"Cechl\u00e1rov\u00e1, K. (2002). On the complexity of exchange-stable roommates.  Discrete Applied Mathematics, 116(3), 279\u2013287. https:\/\/doi.org\/10.1016\/S0166-218X(01)00230-X","DOI":"10.1016\/S0166-218X(01)00230-X"},{"key":"9711_CR18","doi-asserted-by":"publisher","unstructured":"Cechl\u00e1rov\u00e1, K., Manlove, D\u00a0F. (2005). The exchange-stable marriage problem.  Discrete Applied Mathematics, 152(1-3), 109\u2013122. https:\/\/doi.org\/10.1016\/J.DAM.2005.06.003.","DOI":"10.1016\/J.DAM.2005.06.003"},{"key":"9711_CR19","doi-asserted-by":"publisher","unstructured":"Ceylan, E., Chen, J., Roy, S. (2023). Optimal seat arrangement: What are the hard and easy cases? In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pp. 2563\u20132571. ijcai.org, https:\/\/doi.org\/10.24963\/IJCAI.2023\/285","DOI":"10.24963\/IJCAI.2023\/285"},{"key":"9711_CR20","doi-asserted-by":"publisher","unstructured":"Chauhan, A., Lenzner, P., Molitor, L. (2018). Schelling segregation with strategic agents. In: Deng, X., editor, Proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT 2018, Beijing, China, 11-14 September, 2018, Lecture Notes in Computer Science, volume 11059, pp. 137\u2013149. Springer, https:\/\/doi.org\/10.1007\/978-3-319-99660-8_13","DOI":"10.1007\/978-3-319-99660-8_13"},{"key":"9711_CR21","doi-asserted-by":"publisher","unstructured":"Chen, J., Huang, X., Kanj, I\u00a0A., Xia, G. (2004). Linear FPT reductions and computational lower bounds. In: Babai, L., editor, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 13-16 June, 2004, pp. 212\u2013221. ACM, https:\/\/doi.org\/10.1145\/1007352.1007391","DOI":"10.1145\/1007352.1007391"},{"key":"9711_CR22","doi-asserted-by":"publisher","unstructured":"Chen, J., Kanj, I\u00a0A., Xia, G. (2010). Improved upper bounds for vertex cover. Theoretical Computer Science, 411(40-42), 3736\u20133756. https:\/\/doi.org\/10.1016\/J.TCS.2010.06.026","DOI":"10.1016\/J.TCS.2010.06.026"},{"key":"9711_CR23","doi-asserted-by":"publisher","unstructured":"Chen, J., Chmurovic, A., Jogl, F., Sorge, M. (2021). On (coalitional) exchange-stable matching. In: Caragiannis, I., Hansen, K\u00a0A., editors, Proceedings of the 14th International Symposium on Algorithmic Game Theory, SAGT 2021, Aarhus, Denmark, 21-24 September, 2021, Lecture Notes in Computer Science, volume 12885, pp. 205\u2013220. Springer, https:\/\/doi.org\/10.1007\/978-3-030-85947-3_14.","DOI":"10.1007\/978-3-030-85947-3_14"},{"key":"9711_CR24","doi-asserted-by":"publisher","unstructured":"Cygan, M., Fomin, F\u00a0V., Golovnev, A., Kulikov, A\u00a0S., Mihajlin, I., Pachocki, J., Socala, A. (2017). Tight lower bounds on graph embedding problems. Journal of the ACM, 64(3), 18:1\u201318:22. https:\/\/doi.org\/10.1145\/3051094","DOI":"10.1145\/3051094"},{"key":"9711_CR25","doi-asserted-by":"publisher","unstructured":"Cygan, M., Fomin, F\u00a0V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S. (2015) Parameterized Algorithms. Springer, https:\/\/doi.org\/10.1007\/978-3-319-21275-3.","DOI":"10.1007\/978-3-319-21275-3"},{"key":"9711_CR26","doi-asserted-by":"publisher","unstructured":"Downey, R\u00a0G., Fellows, M\u00a0R. (1995). Fixed-parameter tractability and completeness II: on completeness for W[1]. Theoretical Computer Science, 141(1 &2), 109\u2013131. https:\/\/doi.org\/10.1016\/0304-3975(94)00097-3.","DOI":"10.1016\/0304-3975(94)00097-3"},{"key":"9711_CR27","doi-asserted-by":"crossref","unstructured":"Dr\u00e8ze, J\u00a0H., Greenberg, J. (1980). Hedonic coalitions: Optimality and stability. Econometrica, 48(4), 987\u20131003, http:\/\/www.jstor.org\/stable\/1912943.","DOI":"10.2307\/1912943"},{"issue":"125\u2013130","key":"9711_CR28","first-page":"55","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J. (1965). Maximum matching and a polyhedron with 0, 1-vertices. Journal of Research of the National Bureau of Standards B,69(125\u2013130), 55\u201356.","journal-title":"Journal of Research of the National Bureau of Standards B"},{"key":"9711_CR29","doi-asserted-by":"publisher","unstructured":"Gabow, H\u00a0N. (2017). A data structure for nearest common ancestors with linking. ACM Trans. Algorithms, 13(4), 45:1\u201345:28. https:\/\/doi.org\/10.1145\/3108240","DOI":"10.1145\/3108240"},{"key":"9711_CR30","doi-asserted-by":"publisher","unstructured":"Gabow, H\u00a0N., Tarjan, R\u00a0E. (1988). Algorithms for two bottleneck optimization problems. Journal of Algorithms, 9(3), 411\u2013417. https:\/\/doi.org\/10.1016\/0196-6774(88)90031-4","DOI":"10.1016\/0196-6774(88)90031-4"},{"key":"9711_CR31","doi-asserted-by":"publisher","unstructured":"Gairing, M., Savani, R. (2019) Computing stable outcomes in symmetric additively separable hedonic games. Mathematics of Operations Research, 44(3), 1101\u20131121, https:\/\/doi.org\/10.1287\/MOOR.2018.0960.","DOI":"10.1287\/MOOR.2018.0960"},{"key":"9711_CR32","doi-asserted-by":"crossref","unstructured":"Gale, D., Shapley, L\u00a0S. (1962). College admissions and the stability of marriage. The American Mathematical Monthly, 69(1), 9\u201315, http:\/\/www.jstor.org\/stable\/2312726.","DOI":"10.1080\/00029890.1962.11989827"},{"key":"9711_CR33","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H: Freeman."},{"key":"9711_CR34","doi-asserted-by":"publisher","unstructured":"Gourv\u00e8s, L., Lesca, J., Wilczynski, A. (2017). Object allocation via swaps along a social network. In: Sierra, C., editor, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, 19-25 August, 2017, pp. 213\u2013219. ijcai.org, https:\/\/doi.org\/10.24963\/IJCAI.2017\/31","DOI":"10.24963\/IJCAI.2017\/31"},{"key":"9711_CR35","volume-title":"The Stable marriage problem - structure and algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., & Irving, R. W. (1989). The Stable marriage problem - structure and algorithms. Foundations of computing series: MIT Press."},{"key":"9711_CR36","doi-asserted-by":"publisher","unstructured":"Hanaka, T., Ikeyama, A., Ono, H. (2025). Maximizing utilitarian and egalitarian welfare of fractional hedonic games on tree-like graphs. Journal of Combinatorial Optimization, 49(3):53. https:\/\/doi.org\/10.1007\/S10878-025-01283-6","DOI":"10.1007\/S10878-025-01283-6"},{"key":"9711_CR37","doi-asserted-by":"publisher","unstructured":"Hanaka, T., Kiya, H., Maei, Y., Ono., H. (2019). Computational complexity of hedonic games on sparse graphs. In: Baldoni, M., Dastani, M., Liao, B., Sakurai, Y., Zalila-Wenkstern, R. editors, Proceedings of the 22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019, Turin, Italy, 28-31 October, 2019, volume 11873 of Lecture Notes in Computer Science, pp. 576\u2013584. Springer, https:\/\/doi.org\/10.1007\/978-3-030-33792-6_43.","DOI":"10.1007\/978-3-030-33792-6_43"},{"key":"9711_CR38","doi-asserted-by":"publisher","unstructured":"Hanaka, T., Lampis, M. (2022). Hedonic games and treewidth revisited. In Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, editors, Proceedings of the 30th Annual European Symposium on Algorithms, ESA 2022, 5-9 September, 2022, Berlin\/Potsdam, Germany, volume 244 of LIPIcs, pp. 64:1\u201364:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.64.","DOI":"10.4230\/LIPIcs.ESA.2022.64"},{"key":"9711_CR39","unstructured":"Igarashi, A., Elkind, E. (2016). Hedonic games with graph-restricted communication. In: Jonker, C\u00a0M., Marsella, S., Thangarajah, J., Tuyls, K. editors, Proceedings of the 15th International Conference on Autonomous Agents & Multiagent Systems, Singapore, 9-13 May, 2016, pp. 242\u2013250. ACM, http:\/\/dl.acm.org\/citation.cfm?id=2936962."},{"key":"9711_CR40","doi-asserted-by":"publisher","unstructured":"Irving, R\u00a0W. (1985). An efficient algorithm for the \"stable roommates\" problem. Journal of Algorithms, 6(4):577\u2013595. https:\/\/doi.org\/10.1016\/0196-6774(85)90033-1.","DOI":"10.1016\/0196-6774(85)90033-1"},{"key":"9711_CR41","doi-asserted-by":"publisher","unstructured":"Irving, R\u00a0W. (1994). Stable marriage and indifference. Discrete Applied Mathematics, 48(3):261\u2013272, https:\/\/doi.org\/10.1016\/0166-218X(92)00179-P.","DOI":"10.1016\/0166-218X(92)00179-P"},{"key":"9711_CR42","doi-asserted-by":"publisher","unstructured":"Irving, R\u00a0W. (2008). Stable matching problems with exchange restrictions. Journal of Combinatorial Optimization, 16(4):344\u2013360, https:\/\/doi.org\/10.1007\/S10878-008-9153-1.","DOI":"10.1007\/S10878-008-9153-1"},{"key":"9711_CR43","doi-asserted-by":"publisher","unstructured":"Irving, R\u00a0W., Manlove, D\u00a0F. (2002). The stable roommates problem with ties. Journal of Algorithms, 43(1):85\u2013105, https:\/\/doi.org\/10.1006\/JAGM.2002.1219.","DOI":"10.1006\/JAGM.2002.1219"},{"key":"9711_CR44","doi-asserted-by":"publisher","unstructured":"Kerkmann, A\u00a0M., Nguyen, N-T., Rey, A., Rey, L., Rothe, J., Schend, L., Wiechers, A. (2022). Altruistic hedonic games. Journal of Artificial Intelligence Research, 75. https:\/\/doi.org\/10.1613\/JAIR.1.13706.","DOI":"10.1613\/JAIR.1.13706"},{"key":"9711_CR45","doi-asserted-by":"publisher","unstructured":"Kijima, S., Otachi, Y., Saitoh, T., Uno, T. (2012). Subgraph isomorphism in graph classes. Discrete Mathematics, 312(21), 3164\u20133173. https:\/\/doi.org\/10.1016\/J.DISC.2012.07.010","DOI":"10.1016\/J.DISC.2012.07.010"},{"key":"9711_CR46","doi-asserted-by":"publisher","unstructured":"Kreisel, L., Boehmer, N, Froese, V., Niedermeier, R. (2024) Equilibria in schelling games: computational hardness and robustness. Autonomous Agents and Multi-agent Systems, 38(1):9, https:\/\/doi.org\/10.1007\/S10458-023-09632-7.","DOI":"10.1007\/S10458-023-09632-7"},{"key":"9711_CR47","doi-asserted-by":"publisher","unstructured":"Manlove, D\u00a0F. (2013). Algorithmics of Matching Under Preferences, of Series on Theoretical Computer Science. WorldScientific, volume\u00a02https:\/\/doi.org\/10.1142\/8591.","DOI":"10.1142\/8591"},{"key":"9711_CR48","doi-asserted-by":"publisher","unstructured":"Massand, S., Simon, S. (2019). Graphical one-sided markets. In: Kraus, S., editor, Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, 10-16 August, 2019, pp. 492\u2013498. ijcai.org, https:\/\/doi.org\/10.24963\/IJCAI.2019\/70.","DOI":"10.24963\/IJCAI.2019\/70"},{"key":"9711_CR49","doi-asserted-by":"publisher","unstructured":"Nisan, N., Roughgarden, T, Tardos, \u00c9., Vazirani, V\u00a0V. (2007). editors. Algorithmic Game Theory. Cambridge University Press, https:\/\/doi.org\/10.1017\/CBO9780511800481.","DOI":"10.1017\/CBO9780511800481"},{"key":"9711_CR50","doi-asserted-by":"publisher","unstructured":"Okubo, M., Hanaka, T., Ono, H. (2019). Optimal partition of a tree with social distance. In: Das, G\u00a0K., Mandal, P\u00a0S., Mukhopadhyaya, K., Nakano, S-I., editors, Proceedings of the 13th International Conference on Algorithms and Computation, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Lecture Notes in Computer Science, volume 11355, pp. 121\u2013132. Springer, https:\/\/doi.org\/10.1007\/978-3-030-10564-8_10.","DOI":"10.1007\/978-3-030-10564-8_10"},{"key":"9711_CR51","doi-asserted-by":"publisher","unstructured":"Olsen, M., B\u00e6kgaard, L, Tambo, T. (2012). On non-trivial nash stable partitions in additive hedonic games with symmetric 0\/1-utilities. Information Processing Letters, 112(23):903\u2013907. https:\/\/doi.org\/10.1016\/J.IPL.2012.08.016.","DOI":"10.1016\/J.IPL.2012.08.016"},{"key":"9711_CR52","doi-asserted-by":"publisher","unstructured":"Peters, D. (2016). Graphical hedonic games of bounded treewidth. In: Schuurmans, D., Wellman, M\u00a0P., editors, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 12-17 February, 2016, Phoenix, Arizona, USA, pp. 586\u2013593. AAAI Press, https:\/\/doi.org\/10.1609\/AAAI.V30I1.10046.","DOI":"10.1609\/AAAI.V30I1.10046"},{"key":"9711_CR53","doi-asserted-by":"publisher","unstructured":"Saffidine, A., Wilczynski, A. (2018). Constrained swap dynamics over a social network in distributed resource reallocation. In: Deng, X., editor, Proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT 2018, Beijing, China, 11-14 September, 2018, Lecture Notes in Computer Science, volume 11059, pp. 213\u2013225. Springer, https:\/\/doi.org\/10.1007\/978-3-319-99660-8_19.","DOI":"10.1007\/978-3-319-99660-8_19"},{"key":"9711_CR54","unstructured":"Schelling, T\u00a0C. (1968). Models of segregation. The American Economic Review, 59(2), 488\u2013493. http:\/\/www.jstor.org\/stable\/1823701."},{"key":"9711_CR55","doi-asserted-by":"publisher","unstructured":"Schelling, T\u00a0C. (1971). Dynamic models of segregation[CDATA[\\dagger ]]$$\\dagger$$. The Journal of Mathematical Sociology, 1(2), 143\u2013186, 07. https:\/\/doi.org\/10.1080\/0022250X.1971.9989794.","DOI":"10.1080\/0022250X.1971.9989794"},{"key":"9711_CR56","doi-asserted-by":"publisher","unstructured":"Wilczynski, A. (2023). Ordinal hedonic seat arrangement under restricted preference domains: Swap stability and popularity. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pp. 2906\u20132914. ijcai.org, https:\/\/doi.org\/10.24963\/IJCAI.2023\/324.","DOI":"10.24963\/IJCAI.2023\/324"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-025-09711-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-025-09711-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-025-09711-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T06:47:14Z","timestamp":1765176434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-025-09711-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,8]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["9711"],"URL":"https:\/\/doi.org\/10.1007\/s10458-025-09711-x","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,8]]},"assertion":[{"value":"6 June 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2025","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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"33"}}