论文标题
顶点封面游戏的人口单调分配方案
Population Monotonic Allocation Schemes for Vertex Cover Games
论文作者
论文摘要
对于Vertex Cover Games（由Deng等人介绍，Math。plot。Res。，24：751-766，1999），我们研究了人口单调分配方案（由Sprumont，GamesEcon。Chipt。介绍，2：378-394，1990）。我们表明，可以有效地确定顶点覆盖游戏的人口单调分配方案（简称PMA）的存在，并且可以相应地构建PMA（如果存在）。我们还表明，顶点盖游戏的整体PMA-E可以以稳定的匹配为特征，并通过使用Gale-Shapley算法来枚举（由Amer。Math。Math。Math。Math。69：9-15，1962介绍）。
For vertex cover games (introduced by Deng et al., Math. Oper. Res., 24:751-766, 1999), we investigate population monotonic allocation schemes (introduced by Sprumont, Games Econ. Behav., 2: 378-394, 1990). We show that the existence of a population monotonic allocation scheme (PMAS for short) for vertex cover games can be determined efficiently and that a PMAS, if exists, can be constructed accordingly. We also show that integral PMAS-es for vertex cover games can be characterized with stable matchings and be enumerated by employing Gale-Shapley algorithm (introduced by Gale and Shapley, Amer. Math. Monthly, 69:9-15, 1962).
