Abstract
In this paper, we study a variant of hedonic games, called Seat Arrangement. The model is defined by a bijection from agents with preferences to vertices in a graph. The utility of an agent depends on the neighbors in the graph. In this paper, we study the price of stability and fairness in Seat Arrangement, and the computational complexity and the parameterized complexity of finding certain "good'' seat arrangements, say Maximum Welfare Arrangement, Maximin Utility Arrangement, Stable Arrangement, and Envy-free Arrangement.
Original language | English |
---|---|
Title of host publication | AAMAS '20: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems |
Editors | Amal El Fallah Seghrouchni, Gita Sukthankar, Bo An, Neil Yorke-Smith |
Place of Publication | Richland, SC |
Publisher | International Foundation for Autonomous Agents and Multiagent Systems |
Pages | 1777-1779 |
Number of pages | 3 |
ISBN (Print) | 978-1-4503-7518-4 |
DOIs | |
Publication status | Published - 2020 |