Merge-proofness in minimum cost spanning tree problems

被引：0
|
作者：
María Gómez-Rúa
Juan Vidal-Puga
机构：
[1] Universidade de Vigo,Departamento de Estatística e Investigación Operativa
[2] Universidade de Vigo,Research Group in Economic Analysis
来源：
International Journal of Game Theory | 2011年 / 40卷
关键词：
Minimum cost spanning tree problems; Cost sharing; Bird rule; Merge-proofness;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In the context of cost sharing in minimum cost spanning tree problems, we introduce a property called merge-proofness. This property says that no group of agents can be better off claiming to be a single node. We show that the sharing rule that assigns to each agent his own connection cost (the Bird rule) satisfies this property. Moreover, we provide a characterization of the Bird rule using merge-proofness.
引用
收藏
页码：309 / 329
页数：20
相关论文
共 50 条
12345