A generalization of obligation rules for minimum cost spanning tree problems
DATA:
2011-05-16
IDENTIFICADOR UNIVERSAL: http://hdl.handle.net/11093/1098
VERSIÓN EDITADA: https://linkinghub.elsevier.com/retrieve/pii/S037722171000737X
MATERIA UNESCO: 1207.06 Teoría de Juegos
TIPO DE DOCUMENTO: article
RESUMO
Tijs et al. [23] introduce the family of obligation rules for minimum cost spanning tree problems. We give a generalization of such family. We prove that our family coincides with the set of rules satisfying an additivity property and a cost monotonicity property. We also provide two new characterizations for the family of obligation rules using the previous properties. In the first one, we add a property of separability; and in the second one, we add core selection.