The optimistic TU game in minimum cost spanning tree problems

• Autores: Gustavo Bergantiños Cid , Juan José Vidal Puga
• Localización: Working paper series ( RGEA ), Nº. 13, 2007
• Idioma: inglés
• Enlaces
  • Texto Completo Ejemplar
• Resumen

  • 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 N\S are already connected to the source, and agents in S can connect through agents in N\S. We study the Shapley value of this new game.