{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T04:40:47Z","timestamp":1760762447707,"version":"build-2065373602"},"reference-count":7,"publisher":"Information Processing Society of Japan","issue":"0","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Information Processing"],"published-print":{"date-parts":[[2025]]},"DOI":"10.2197\/ipsjjip.33.755","type":"journal-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T22:09:38Z","timestamp":1760479778000},"page":"755-764","source":"Crossref","is-referenced-by-count":0,"title":["Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs"],"prefix":"10.2197","volume":"33","author":[{"given":"Sota","family":"Kawase","sequence":"first","affiliation":[{"name":"School of Social Information Science, University of Hyogo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuichi","family":"Miyazaki","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science, University of Hyogo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1012","reference":[{"key":"1","unstructured":"[1] Aziz, H., Lisowski, G., Suzuki, M. and Vollen, J.: Neighborhood stability in assignments on graphs, arXiv preprint arXiv:2407.05240 (2023)."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Berriaud, D., Constantinescu, A. and Wattenhofer, R: Stable dinner party seating arrangements, <i>Proc. 19th International Conference on Web and Internet Economics<\/i> (<i>WINE 2023<\/i>), pp.3-20 (2024).","DOI":"10.1007\/978-3-031-48974-7_1"},{"key":"3","unstructured":"[3] Bodlaender, H.L., Hanaka, T., Jaffke, L., Ono, H., Otachi, Y. and van der Zanden, T.C.: Hedonic seat arrangement problems, <i>Proc. 19th International Conference on Autonomous Agents and Multiagent Systems<\/i> (<i>AAMAS 2020<\/i>), pp.1777-1779 (2020)."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Ceylan, E., Chen, J. and Roy, S.: Optimal seat arrangement: What are the hard and easy cases?, <i>Proc. 32nd International Joint Conference on Artificial Intelligence<\/i> (<i>IJCAI 2023<\/i>), pp.2563-2571 (2023).","DOI":"10.24963\/ijcai.2023\/285"},{"key":"5","unstructured":"[5] Garey, M.R. and Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company (1979)."},{"key":"6","unstructured":"[6] Rodr\u00edguez, J.: Seat arrangement problems under B-utility and W-utility, arXiv preprint arXiv:2406.09965 (2024)."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Wilczynski, A.: Ordinal hedonic seat arrangement under restricted preference domains: Swap stability and popularity, <i>Proc. 32nd International Joint Conference on Artificial Intelligence<\/i> (<i>IJCAI 2023<\/i>), pp.2906-2914 (2023).","DOI":"10.24963\/ijcai.2023\/324"}],"container-title":["Journal of Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/33\/0\/33_755\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T04:09:23Z","timestamp":1760760563000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/33\/0\/33_755\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":7,"journal-issue":{"issue":"0","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.2197\/ipsjjip.33.755","relation":{},"ISSN":["1882-6652"],"issn-type":[{"type":"electronic","value":"1882-6652"}],"subject":[],"published":{"date-parts":[[2025]]}}}