A characterization of Kruskal sharing rules for minimum cost spanning tree problems

被引:20
|
作者
Lorenzo, Leticia [1 ]
Lorenzo-Freire, Silvia [2 ]
机构
[1] Univ Vigo, Res Grp Econ Anal, Fac CC EE & Empresariais, Vigo 36310, Spain
[2] Univ A Coruna, Fac Informat, La Coruna 15071, Spain
关键词
Minimum cost spanning tree problems; Kruskal's algorithm; Sharing rules; GAMES; MONOTONICITY; ALLOCATION; POPULATION; NUCLEOLUS;
D O I
10.1007/s00182-008-0147-0
中图分类号
F [经济];
学科分类号
02 ;
摘要
In Tijs et al. (Eur J Oper Res 175:121-134, 2006) a new family of cost allocation rules is introduced in the context of cost spanning tree problems. In this paper we provide the first characterization of this family by means of population monotonicity and a property of additivity.
引用
收藏
页码:107 / 126
页数:20
相关论文
共 50 条