Local fairness in hedonic games via individual threshold coalitions

Local fairness in hedonic games via individual threshold coalitions
复制标题

DOI:
10.1016/j.tcs.2021.03.027
复制
发表时间:
2021-06-01
影响因子:
1.1
通讯作者:
Rothe, Joerg
Rothe, Joerg
中科院分区:
计算机科学4区
文献类型:
--
作者:
Kerkmann, Anna Maria;Nguyen, Nhan-Tam;Rothe, Joerg

文献摘要

被引文献

相似文献

享乐主义游戏是一种联盟队形游戏,玩家只指定对他们所在联盟的偏好。引入并系统地研究了享乐博弈中的三种局部公平概念,即最大最小公平、大联盟公平和最小最大公平。为此,我们为这三个概念定义了合适的阈值联盟。联盟结构(即,将球员划分为联盟)被认为是局部公平的,如果该结构中的所有球员的联盟至少与他们的门槛联盟一样好。基于这种方法,我们通过适当地借鉴公平划分中的公平概念,引入了三个具体的局部公平概念。我们证明了它们形成了一个适当的层次,以及它们与以前在享乐游戏中研究的解概念是如何联系的。我们还研究了在可加可分离享乐博弈中寻找门限联盟和判断公平联盟结构是否存在的计算方面,并研究了局部公平的相关代价。(C)2021年爱思唯尔B.V.保留所有权利。
Hedonic games are coalition formation games where players only specify preferences over coalitions they are part of. We introduce and systematically study three local fairness notions in hedonic games called max-min fairness, grand-coalition fairness, and min-max fairness. To this end, we define suitable threshold coalitions for these three concepts. Acoalition structure (i.e., a partition of the players into coalitions) is considered locally fair if all players' coalitions in this structure are each at least as good as their threshold coalitions. Based on this approach, we then introduce three specific notions of local fairness by suitably adapting fairness notions from fair division. We show that they form a proper hierarchy and how they are related to previously studied solution concepts in hedonic games. We also study the computational aspects of finding threshold coalitions and of deciding whether fair coalition structures exist in additively separable hedonic games, and we investigate the related price of local fairness. (C) 2021 Elsevier B.V. All rights reserved.