Munich Personal RePEc Archive

No advantageous merging in minimum cost spanning tree problems

Gomez-Rua, Maria and Vidal-Puga, Juan (2006): No advantageous merging in minimum cost spanning tree problems.

[img]
Preview
PDF
MPRA_paper_601.pdf

Download (310Kb) | Preview

Abstract

In the context of cost sharing in minimum cost spanning tree problems, we introduce a property called No Advantageous Merging. This property implies 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 No Advantageous Merging.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.