1. Bergantiños G., Lorenzo L. (2004). A non-cooperative approach to the cost spanning tree problem. Math Methods Oper Res 59: 393–403
2. 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)
3. 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)
4. 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)
5. 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)