A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- 112 Downloads
In this paper we present an axiomatic characterization of the weighted Shapley value of the optimistic TU game associated with a minimum cost spanning tree problem. This characterization is based on two monotonicity properties, population monotonicity (if a new agent joint the society nobody is worse off) and the strong cost monotonicity (if the connection cost between any pair of agents increases nobody is better off), and weighted share of extra costs (the extra costs should be divided proportionally to the weights of the agents).
KeywordsMinimum cost spanning tree problems Weighted Shapley values
JEL Classification NumbersC70 C71
Unable to display preview. Download preview PDF.
- Bergantiños G., Lorenzo L. (2004). A non-cooperative approach to the cost spanning tree problem. Math Methods Oper Res 59: 393–403Google Scholar
- Bergantiños, G., Lorenzo-Freire, S.: “Optimistic” weighted Shapley rules in minimum cost spanning tree problems. Eur J Oper Res (forthcoming). Available at http://webs.uvigo.es/gbergant/papers/optShapley.pdf (2007)Google Scholar
- Bergantiños, G., Vidal-Puga, J.J.: A fair rule in cost spanning tree problems. J Econ Theory (forthcoming). Available at http://econwpa.wustl.edu:80/eps/game/papers/0504/0504001.pdf (2006a)Google Scholar
- Bergantiños, G., Vidal-Puga, J.J.: The optimistic TU game in minimum cost spanning tree problems. Int J Game Theory (forthcoming). Available at http://econwpa.wustl.edu:80/eps/game/papers/0509/ 0509001.pdf (2006b)Google Scholar
- Bergantiños, G., Vidal-Puga, J.J.: Several approaches to the same rule in cost spanning tree problems. Mimeo. Available at http://webs.uvigo.es/gbergant/papers/cstapproaches.pdf (2006c)Google Scholar
- Feltkamp V., Tijs S., Muto S. (1994). On the irreducible core and the equal remaining obligation rule of minimum cost extension problems. Mimeo, Tilburg UniversityGoogle Scholar
- Prim R.C. (1957). Shortest connection networks and some generalizations. Bell Syst Technol J 36: 1389–1401Google Scholar
- Shapley, L.S.: Additive and non-additive set functions. PhD Thesis, Department of Mathematics, Princeton University (1953a)Google Scholar
- Shapley L.S. (1953b). A value for n-person games. In: Kuhn HW, Tucker AW (eds) Contributions to the Theory of Games II. Princeton, Princeton University Press, pp 307–317Google Scholar