Merge-proofness in minimum cost spanning tree problems
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.
KeywordsMinimum cost spanning tree problems Cost sharing Bird rule Merge-proofness
Unable to display preview. Download preview PDF.
- Bergantiños G, Vidal-Puga J (2004) The folk solution and Boruvka’s algorithm in minimum cost spanning tree problems. Mimeo. http://webs.uvigo.es/vidalpuga
- Feltkamp V, Tijs S, Muto S (1994) On the irreducible core and the equal remaining obligation rule of minimum cost extension problems. Tilburg University, MimeoGoogle Scholar
- Özsoy H (2006) A characterization of Bird’s rule. Rice University, MimeoGoogle Scholar
- Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Technol J 36: 1389–1401Google Scholar
- Sharkey WW (1995) Networks models in economics. In: Handbooks of operation research and management science. Networks, vol 8, Chap 9. North Holland, AmsterdamGoogle Scholar