Population Monotonic Allocation Schemes for Vertex Cover Games
Computer Science and Game Theory
2020-10-20 v3 Discrete Mathematics
Abstract
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).
Keywords
Cite
@article{arxiv.2002.02824,
title = {Population Monotonic Allocation Schemes for Vertex Cover Games},
author = {Han Xiao and Qizhi Fang and Ding-Zhu Du},
journal= {arXiv preprint arXiv:2002.02824},
year = {2020}
}
Comments
To appear in Theoretical Computer Science