Stability in Role Based Hedonic Games
Stability in Role Based Hedonic Games
复制标题
基于角色的快乐游戏的稳定性
DOI:
10.1016/j.geb.2003.10.003
复制
发表时间:
2015
期刊:
影响因子:
--
通讯作者:
J. Goldsmith
中科院分区:
文献类型:
--
作者:
Matthew Spradling;J. Goldsmith
In the hedonic coalition formation game model Roles and Teams Hedonic Games (RTHG), agents view teams as compositions of available roles. An agent's utility for a partition is based upon which role she fulfills within the coalition and which additional roles are being fulfilled within the coalition. Goals for matchmaking in this setting include forming partitions which optimize some function of the utility. Optimization problems related to finding Perfect, MaxSum and MaxMin partitions in RTHG are all known to be NP-hard. In this paper, we introduce a Role Based Hedonic Game model (RBHG) which has no fixed team size and a more relaxed set of compositions. We consider the related problem of stability in RBHG. Given a set of available movements for agents, a partition is stable iff no agent would choose to move from the partition to another partition. We show NP-completeness for several RBHG stability problems and coNP-completeness for two verification problems.