The optimistic TU game in minimum cost spanning tree problems

  1. Gustavo Bergantiños
  2. Juan J. Vidal-Puga
Journal:
Working paper series ( RGEA )

Year of publication: 2007

Issue: 13

Type: Working paper

DIALNET GOOGLE SCHOLAR lock_openOpen access editor

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 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.

Data source: Dialnet