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
相关论文
共 28 条
  • [1] Aarts H(1993)The irreducible core of a minimum cost spanning tree game Math Methods Oper Res 38 163-174
  • [2] Driessen T(2008)Optimistic weighted Shapley rules in minimum cost spanning tree problems Eur J Oper Res 185 289-298
  • [3] Bergantiños G(2007)A fair rule in minimum cost spanning tree problems J Econ Theory 137 326-352
  • [4] Lorenzo-Freire S(2007)The optimistic TU game in minimum cost spanning tree problems Int J Game Theory 36 223-239
  • [5] Bergantiños G(1976)On cost allocation for a spanning tree: a game theoretic approach Networks 6 335-350
  • [6] Vidal-Puga J(2004)The P-value for cost sharing in minimum cost spanning tree situations Theory Decis 56 47-61
  • [7] Bergantiños G(1999)Null players out? Linear values for games with variable supports Int Game Theory Rev 1 301-314
  • [8] Vidal-Puga J(2004)Cost monotonicity, consistency and minimum cost spanning tree games Games Econ Behav 48 223-248
  • [9] Bird CG(1981)Minimum cost spanning tree games Math Programm 21 1-18
  • [10] Branzei R(1984)On the core and nucleolus of the minimum cost spanning tree games Math Programm 29 323-347
123