Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs
S Kawase, S Miyazaki - arxiv preprint arxiv:2411.10719, 2024 - arxiv.org
The Seat Arrangement Problem is a problem of finding a desirable seat arrangement for
given preferences of agents and a seat graph that represents a configuration of seats. In this …
given preferences of agents and a seat graph that represents a configuration of seats. In this …