A monotonic and merge‐proof rule in minimum cost spanning tree situations

  1. María Gómez Rúa 1
  2. Vidal Puga 1
  1. 1 Research Group in Economic Analysis. Universidade de Vigo
Buch:
XII Congreso Galego de Estatística e Investigación de Operacións: Lugo, 22-23-24 de outubro de 2015. Actas
  1. Ginzo Villamayor, María José (ed. lit.)
  2. Alonso Meijide, José María (ed. lit.)
  3. Ramil Novo, Luis Alberto (ed. lit.)

Verlag: Sociedade Galega para a Promoción da Estatística e da Investigación de Operacións (SGAPEIO) ; Servizo de Publicacións ; Deputación de Lugo

ISBN: 978-84-8192-522-7

Datum der Publikation: 2015

Seiten: 33-39

Kongress: Congreso galego de Estatística e Investigación de Operacións (12. 2015. Lugo)

Art: Konferenz-Beitrag

Zusammenfassung

We present a new model for cost sharing in minimum cost spanning tree problems, so that the planner can identify the agents that merge. Under this new framework, and as opposed to the traditional model, there exist rules that satisfy merge-proofness. Besides, by strengthening this property and adding some other properties, such as population-monotonicity and solidarity, we characterize a unique rule that coincides with the weighted Shapley value of an associated cost game.