{"id":"https://openalex.org/W4415163790","doi":"https://doi.org/10.2197/ipsjjip.33.755","title":"Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs","display_name":"Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415163790","doi":"https://doi.org/10.2197/ipsjjip.33.755"},"language":"en","primary_location":{"id":"doi:10.2197/ipsjjip.33.755","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.755","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_755/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_755/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114730173","display_name":"Sota Kawase","orcid":null},"institutions":[{"id":"https://openalex.org/I180941496","display_name":"University of Hyogo","ror":"https://ror.org/0151bmh98","country_code":"JP","type":"education","lineage":["https://openalex.org/I180941496"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Sota Kawase","raw_affiliation_strings":["School of Social Information Science, University of Hyogo"],"affiliations":[{"raw_affiliation_string":"School of Social Information Science, University of Hyogo","institution_ids":["https://openalex.org/I180941496"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101641045","display_name":"Shuichi Miyazaki","orcid":"https://orcid.org/0000-0003-0369-1970"},"institutions":[{"id":"https://openalex.org/I180941496","display_name":"University of Hyogo","ror":"https://ror.org/0151bmh98","country_code":"JP","type":"education","lineage":["https://openalex.org/I180941496"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shuichi Miyazaki","raw_affiliation_strings":["Graduate School of Information Science, University of Hyogo"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science, University of Hyogo","institution_ids":["https://openalex.org/I180941496"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5114730173"],"corresponding_institution_ids":["https://openalex.org/I180941496"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.39732366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"0","first_page":"755","last_page":"764"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9671000242233276,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9671000242233276,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9409999847412109,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.9186999797821045,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5953999757766724},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5773000121116638},{"id":"https://openalex.org/keywords/lattice-graph","display_name":"Lattice graph","score":0.5388000011444092},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47699999809265137},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43149998784065247},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4287000000476837},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.42750000953674316}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7972000241279602},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5953999757766724},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5773000121116638},{"id":"https://openalex.org/C145580432","wikidata":"https://www.wikidata.org/wiki/Q6497118","display_name":"Lattice graph","level":5,"score":0.5388000011444092},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47699999809265137},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44339999556541443},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43149998784065247},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4287000000476837},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.42750000953674316},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4147000014781952},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3783999979496002},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.34709998965263367},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3325999975204468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33169999718666077},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.31299999356269836},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.30649998784065247},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.27489998936653137}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2197/ipsjjip.33.755","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.755","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_755/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.2197/ipsjjip.33.755","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.755","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_755/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1910058160","display_name":"Extensions of stable matching problems and algorithm design","funder_award_id":"20K11677","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5056495607","display_name":"Exploring New Designs in Symmetric Cryptography Through a By-Design Approach and High-Resolution Analysis","funder_award_id":"24H00696","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5815285521","display_name":"\u62e1\u5f35\u3092\u65bd\u3057\u305f\u5b89\u5b9a\u30de\u30c3\u30c1\u30f3\u30b0\u554f\u984c\u306b\u5bfe\u3059\u308b\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u7814\u7a76","funder_award_id":"25K14996","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G6703594460","display_name":null,"funder_award_id":"JP20K11677","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7840269759","display_name":null,"funder_award_id":"JP20K","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320322622","display_name":"Toyota Motor Corporation","ror":"https://ror.org/02zqm6r10"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320335268","display_name":"Research Institute for Mathematical Sciences","ror":"https://ror.org/02kpeqv85"},{"id":"https://openalex.org/F4320337380","display_name":"Division of Mathematical Sciences","ror":"https://ror.org/051fftw81"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415163790.pdf","grobid_xml":"https://content.openalex.org/works/W4415163790.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Seat":[1],"Arrangement":[2],"Problem":[3],"is":[4,52,64],"the":[5,33,61],"problem":[6],"of":[7,16,26,36,67],"finding":[8],"a":[9,19,24,49,65],"desirable":[10],"seat":[11,20,50,62],"arrangement":[12,41,46],"for":[13,92],"given":[14],"preferences":[15],"agents":[17],"and":[18,43,70,85],"graph":[21,51,63],"that":[22,87],"represents":[23],"configuration":[25],"seats.":[27],"In":[28,79],"this":[29,80],"paper,":[30,81],"we":[31,82],"consider":[32],"decision":[34],"problems":[35,72,89],"determining":[37],"if":[38],"an":[39,44,53],"envy-free":[40],"exists":[42],"exchange-stable":[45],"exists,":[47],"when":[48],"l":[54,95],"\u00d7":[55],"m":[56,69],"grid":[57],"graph.":[58],"When":[59],"l=1,":[60],"path":[66],"length":[68],"both":[71,88],"have":[73],"been":[74],"known":[75],"to":[76],"be":[77],"NP-complete.":[78],"extend":[83],"it":[84],"show":[86],"are":[90],"NP-complete":[91],"any":[93],"integer":[94],"\u2265":[96],"2.":[97]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-15T00:00:00"}