Faigle, Ulrich; Kern, Walter; Hochstättler, Winfried; … - In: International Journal of Game Theory 26 (1997) 3, pp. 361-366
Let $N=\{ 1,...,n\} $ be a finite set of players and $K_{N}$ the complete graph on the node set $N\cup \{ 0\} $. Assume that the edges of $K_{N}$ have nonnegative weights and associate with each coalition $S\subseteq N$ of players as cost $c(S)$ the weight of a minimal spanning tree on the node...
