Hedonic Seat Arrangement Problems

Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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 languageEnglish
Title of host publicationAAMAS '20: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems
EditorsAmal El Fallah Seghrouchni, Gita Sukthankar, Bo An, Neil Yorke-Smith
Place of PublicationRichland, SC
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems
Pages1777-1779
Number of pages3
ISBN (Print)978-1-4503-7518-4
DOIs
Publication statusPublished - 2020

Fingerprint

Dive into the research topics of 'Hedonic Seat Arrangement Problems'. Together they form a unique fingerprint.

Cite this