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 | Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020 |
Editors | Bo An, Amal El Fallah Seghrouchni, Gita Sukthankar |
Publisher | International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) |
Pages | 1777-1779 |
Number of pages | 3 |
Volume | 2020-May |
ISBN (Electronic) | 9781450375184 |
Publication status | Published - 1 Jan 2020 |
Event | 19th International Conference on Autonomous Agents and Multiagent Systems - Online, Auckland, New Zealand Duration: 9 May 2020 → 13 May 2020 Conference number: 19 https://aamas2020.conference.auckland.ac.nz/# |
Publication series
Series | Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS |
---|---|
Volume | 2020-May |
ISSN | 1548-8403 |
Conference
Conference | 19th International Conference on Autonomous Agents and Multiagent Systems |
---|---|
Abbreviated title | AAMAS 2020 |
Country/Territory | New Zealand |
City | Auckland |
Period | 9/05/20 → 13/05/20 |
Internet address |
Keywords
- Computational complexity
- Envy-freeness
- Hedonic game
- Local search
- Parameterized complexity
- Stability