The optimistic TU game in minimum cost spanning tree problems |
| |
| Authors: | Gustavo Bergantiños Juan J. Vidal-Puga |
| |
| Affiliation: | (1) Research Group in Economic Analysis, Facultade de Ciencias Económicas, Universidade de Vigo, Campus As Lagoas-Marcosende, 36310 Vigo, Spain;(2) Research Group in Economic Analysis, Facultade de Ciencias Sociais, Universidade de Vigo, Campus A Xunqueira, 36005 Pontevedra, Spain |
| |
| Abstract: | We associate an optimistic TU game with each minimum cost spanning tree problem. We define the worth of a coalition S as the cost of connecting agents in S to the source assuming that agents in NS are already connected to the source, and agents in S can connect through agents in NS. We study the Shapley value of this new game. We thank Hervé Moulin, William Thomson, and two referees for helpful comments. Financial support from the Ministerio de Ciencia y Tecnologia and FEDER through grant SEJ2005-07637-c02-01 is gratefully acknowledged. |
| |
| Keywords: | Minimum cost spanning tree problems Optimistic TU game Shapley value |
| 本文献已被 SpringerLink 等数据库收录！ |
|
