Stable Sets in Matching Problems with Coalitional Sovereignty and Path Dominance
Stable Sets in Matching Problems with Coalitional Sovereignty and Path Dominance
复制标题
联合主权和路径优势匹配问题的稳定集
DOI:
10.2139/ssrn.2791994
复制
发表时间:
2016
期刊:
影响因子:
--
通讯作者:
Vincent Vannetelbosch
中科院分区:
文献类型:
--
作者:
P. Herings;A. Mauleon;Vincent Vannetelbosch
We study von Neumann Morgenstern stable sets for one-to-one matching problems under the assumption of coalitional sovereignty, meaning that a deviating coalition of players does not have the power to arrange the matches of agents outside the coalition. We study both the case of pairwise and coalitional deviations. We argue further that dominance has to be replaced by path dominance along the lines of van Deemen (1991) and Page and Wooders (2009). This results in the pairwise myopic vNM set and the myopic vNM set, respectively. We obtain a unique prediction for both types of stable sets: the set of matchings that belong to the core. We also show that the pairwise and coalitional analogues of the level-1 farsighted set yield the core as the unique prediction.
影响因子:
1.6
作者:
M. Chwe
通讯作者:
M. Chwe