A characterization of Kruskal sharing rules for minimum cost spanning tree problems
DATA:
2009-03
IDENTIFICADOR UNIVERSAL: http://hdl.handle.net/11093/1100
VERSIÓN EDITADA: http://link.springer.com/10.1007/s00182-008-0147-0
MATERIA UNESCO: 5399 Otras Especialidades económicas
TIPO DE DOCUMENTO: article
RESUMO
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.