当前位置: X-MOL 学术arXiv.cs.GT › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Hedonic Expertise Games
arXiv - CS - Computer Science and Game Theory Pub Date : 2020-11-03 , DOI: arxiv-2011.01778
Bugra Caskurlu, Fatih Erdem Kizilkaya, Berkehan Ozen

We consider a team formation setting where agents have varying levels of expertise in a global set of required skills, and teams are ranked with respect to how well the expertise of teammates complement each other. We model this setting as a hedonic game, and we show that this class of games possesses many desirable properties, some of which are as follows: A partition that is Nash stable, core stable and Pareto optimal is always guaranteed to exist. A contractually individually stable partition (and a Nash stable partition in a restricted setting) can be found in polynomial-time. A core stable partition can be approximated within a factor of $1 - \frac{1}{e}$, and this bound is tight unless $\sf P = NP$. We also introduce a larger and relatively general class of games, which we refer to as monotone submodular hedonic games with common ranking property. We show that the above multi-concept existence guarantee also holds for this larger class of games.

中文翻译:

享乐专长游戏

我们考虑了一个团队组建环境,其中座席在全球所需技能方面具有不同水平的专业知识,并且团队根据队友的专业知识相互补充的程度进行排名。我们将此设置建模为享乐游戏,并表明此类游戏具有许多理想的属性,其中一些如下: 始终保证存在纳什稳定、核心稳定和帕累托最优的分区。可以在多项式时间中找到合同上单独的稳定分区(以及受限设置中的 Nash 稳定分区)。核心稳定分区可以近似为 $1 - \frac{1}{e}$ 的因子,除非 $\sf P = NP$,否则这个界限很紧。我们还介绍了更大且相对一般的游戏类别,我们将其称为具有共同排名属性的单调子模块享乐游戏。我们表明,上述多概念存在保证也适用于这一类更大的游戏。
更新日期:2020-11-04
down
wechat
bug