论文信息 - On some properties of cost allocation rules in minimum cost spanning tree problems

On some properties of cost allocation rules in minimum cost spanning tree problems

We consider four cost allocation rules in minimum cost spanning tree problems. These rules were introduced by Bird (1976), Dutta and Kar (2004), Kar (2002), and Feltkamp, Tijs and Muto (1994), respectively. We give a list of desirable properties and we study which properties are satisfied by these rules.

G. Bergantiños | J. Vidal-Puga

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

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

[3] L. Shapley. A Value for n-person Games , 1988 .

[4] Vincent Feltkamp,et al. On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems , 1994 .

[5] Anirban Kar,et al. Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games , 2002, Games Econ. Behav..

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

[7] The P-value for cost sharing in minimum , 2004 .

[8] Gustavo Bergantiños,et al. A non-cooperative approach to the cost spanning tree problem , 2004, Math. Methods Oper. Res..

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

[10] Gustavo Bergantiños,et al. Optimal Equilibria in the Non-Cooperative Game Associated with Cost Spanning Tree Problems , 2005, Ann. Oper. Res..

[11] Additivity in cost spanning tree problems , 2005 .

[12] Gustavo Bergantiños,et al. The optimistic TU game in minimum cost spanning tree problems , 2007, Int. J. Game Theory.

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