The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources

We consider a problem where a group of agents is interested in some goods provided by a supplier with multiple sources. To be served, each agent should be connected directly or indirectly to all sources of the supplier for a safety reason. This problem generalizes the classical minimum cost spanning problem with one source by allowing the possibility of multiple sources. In this paper, we extend the definitions of the folk rule to be suitable for minimal cost spanning tree problems with multiple sources and present its axiomatic characterizations.

[1]  Gustavo Bergantiños,et al.  Additivity in minimum cost spanning tree problems , 2009 .

[2]  Hervé Moulin,et al.  Sharing a minimal cost spanning tree: Beyond the Folk solution , 2010, Games Econ. Behav..

[3]  G. Bergantiños,et al.  On some properties of cost allocation rules in minimum cost spanning tree problems , 2008 .

[4]  Jeroen Kuipers,et al.  Minimum cost forest games , 1997, Int. J. Game Theory.

[5]  Gustavo Bergantiños,et al.  A generalization of obligation rules for minimum cost spanning tree problems , 2011, Eur. J. Oper. Res..

[6]  Henk Norde,et al.  Minimum cost spanning tree games and population monotonic allocation schemes , 2004, Eur. J. Oper. Res..

[7]  Gustavo Bergantiños,et al.  A fair rule in minimum cost spanning tree problems , 2007, J. Econ. Theory.

[8]  Gustavo Bergantiños,et al.  A characterization of the folk rule for multi-source minimal cost spanning tree problems , 2019, Oper. Res. Lett..

[9]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[10]  Daniel Granot,et al.  Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem , 1992, Math. Oper. Res..

[11]  C. G. Bird,et al.  On cost allocation for a spanning tree: A game theoretic approach , 1976, Networks.

[12]  Markus Leitner,et al.  Hop constrained Steiner trees with multiple root nodes , 2014, Eur. J. Oper. Res..

[13]  Anirban Kar,et al.  Cost monotonicity, consistency and minimum cost spanning tree games , 2004, Games Econ. Behav..

[14]  Gustavo Bergantiños,et al.  Cost additive rules in minimum cost spanning tree problems with multiple sources , 2020, Annals of Operations Research.

[15]  Gustavo Bergantiños,et al.  The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources , 2019, Math. Soc. Sci..

[16]  Arthur M. Farley,et al.  Multi-Source Spanning Tree Problems , 2000, J. Interconnect. Networks.

[17]  L. S. Shapley,et al.  17. A Value for n-Person Games , 1953 .

[18]  Silvia Lorenzo-Freire,et al.  A characterization of Kruskal sharing rules for minimum cost spanning tree problems , 2009, Int. J. Game Theory.

[19]  Henk Norde,et al.  The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations , 2003 .

[20]  Gustavo Bergantiños,et al.  The family of cost monotonic and cost additive rules in minimum cost spanning tree problems , 2010, Soc. Choice Welf..

[21]  Gustavo Bergantiños,et al.  Characterization of monotonic rules in minimum cost spanning tree problems , 2015, Int. J. Game Theory.

[22]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[23]  Edward C. Rosenthal.  The minimum cost spanning forest game , 1987 .

[24]  Gustavo Bergantiños,et al.  On obligation rules for minimum cost spanning tree problems , 2010, BQGT.