Unknown Agents in Friends Oriented Hedonic Games: Stability and Complexity
Abstract
We study hedonic games under friends appreciation, where each agent considers other agents friends, enemies, or unknown agents. Although existing work assumed that unknown agents have no impact on an agent’s preference, it may be that her preference depends on the number of unknown agents in her coalition. We extend the existing preference, friends appreciation, by proposing two alternative attitudes toward unknown agents, extraversion and introversion, depending on whether unknown agents have a slightly positive or negative impact on preference. When each agent prefers coalitions with more unknown agents, we show that both core stable outcomes and individually stable outcomes may not exist. We also prove that deciding the existence of the core and the existence of an individual stable coalition structure are respectively NPNP-complete and NP-complete.
Cite
Text
Barrot et al. "Unknown Agents in Friends Oriented Hedonic Games: Stability and Complexity." AAAI Conference on Artificial Intelligence, 2019. doi:10.1609/AAAI.V33I01.33011756Markdown
[Barrot et al. "Unknown Agents in Friends Oriented Hedonic Games: Stability and Complexity." AAAI Conference on Artificial Intelligence, 2019.](https://mlanthology.org/aaai/2019/barrot2019aaai-unknown/) doi:10.1609/AAAI.V33I01.33011756BibTeX
@inproceedings{barrot2019aaai-unknown,
title = {{Unknown Agents in Friends Oriented Hedonic Games: Stability and Complexity}},
author = {Barrot, Nathanaël and Ota, Kazunori and Sakurai, Yuko and Yokoo, Makoto},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2019},
pages = {1756-1763},
doi = {10.1609/AAAI.V33I01.33011756},
url = {https://mlanthology.org/aaai/2019/barrot2019aaai-unknown/}
}