顶点覆盖对策的种群单调分配方案
Population Monotonic Allocation Schemes for Vertex Cover Games
摘要：
对于顶点覆盖博弈（由Deng等人介绍，数学。歌剧。结果：751-766，1999），我们研究了种群单调分配方案（由Sprumont，Games Econ. Behav.，2：378-394，1990）。我们证明了顶点覆盖对策的种群单调分配方案（简称PMAS）的存在性可以有效地确定，如果存在PMAS，则可以相应地构造PMAS。我们还证明了顶点覆盖对策的积分PMAS-es可以用稳定匹配来刻画，并可以用Gale-Shapley算法（Gale and Shapley，Amer. Math. Monthly，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).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
