A fair rule in minimum cost spanning tree problems

Journal of Economic Theory

Volumn 137, Issue 1, 2007, Pages 326-352

  Bergantiños, Gustavo ^a   Vidal Puga, Juan J ^a  

^a UNIVERSITY OF VIGO   (Spain)

Author keywords

Cost allocation; Monotonicity; Spanning tree

Indexed keywords

EID: 36048994054     PISSN: 00220531     EISSN: 10957235     Source Type: Journal    
DOI: 10.1016/j.jet.2006.11.001     Document Type: Article

References (21)

1. Aarts H., and Driessen T. The irreducible core of a minimum cost spanning tree game. Math. Methods Operations Res. 38 (1993) 163-174
2. Bergantiños G., and Lorenzo L. A non-cooperative approach to the cost spanning tree problem. Math. Methods Operations Res. 59 (2004) 393-403
3. G. Bergantiños, J.J. Vidal-Puga, Additivity in cost spanning tree problems, RGEA Working Paper 10-05, University of Vigo, 2005.
4. G. Bergantiños, J.J. Vidal-Puga, Several approaches to the same rule in minimum cost spanning tree problems, Mimeo, University of Vigo, 2005.
5. G. Bergantiños, J.J. Vidal-Puga, Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms, Mimeo, University of Vigo, 2006.
6. G. Bergantiños, J.J. Vidal-Puga, On some properties of three rules in minimum cost spanning tree problems, Mimeo, University of Vigo, 2006.
7. G. Bergantiños, J.J. Vidal-Puga, The optimistic TU game in minimum cost spanning tree problems, Int. J. Game Theory (2006), forthcoming.
8. Bird C.G. On cost allocation for a spanning tree: a game theoretic approach. Networks 6 (1976) 335-350
9. Brânzei R., Moretti S., Norde H., and Tijs S. The P-value for cost sharing in minimum cost spanning tree situations. Theory Dec. 56 (2004) 47-61
10. Dutta B., and Kar A. Cost monotonicity, consistency and minimum cost spanning tree games. Games Econ. Behav. 48 (2004) 223-248
11. V. Feltkamp, S. Tijs, S. Muto, On the irreducible core and the equal remaining obligation rule of minimum cost extension problems, Mimeo, Tilburg University, 1994.
12. Granot D., and Huberman G. Minimum cost spanning tree games. Math. Programming 21 (1981) 1-18
13. Granot D., and Huberman G. On the core and nucleolus of the minimum cost spanning tree game. Math. Programming 29 (1984) 323-347
14. Granot D., and Maschler M. Spanning network games. Int. J. Game Theory 27 (1998) 467-500
15. Kar A. Axiomatization of the Shapley value on minimum cost spanning tree games. Games Econ. Behav. 38 (2002) 265-277
16. Kruskal J. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceed. Amer. Math. Society 7 (1956) 48-50
17. Megiddo N. Computational complexity and the game theory approach to cost allocation for a tree. Mathematics Operations Res. 3 (1978) 189-196
18. Prim R.C. Shortest connection networks and some generalizations. Bell Systems Tech. J. 36 (1957) 1389-1401
19. Shapley L.S. A value for n-person games. In: Kuhn H.W., and Tucker A.W. (Eds). Contributions to the Theory of Games II (1953), Princeton University Press, Princeton, NJ 307-317
20. Sharkey W.W. Networks models in economics. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. (Eds). Handbooks of Operation Research and Management Science, Network Routing vol. 8 (1995), Elsevier, Amsterdam 713-765 (Chapter 9)
21. Young H.P. Monotonic solutions of cooperative games. Int. J. Game Theory 14 (1985) 65-72