Cost allocation problems on networks can be interpreted as cooperative games on a graph structure. In the classical standard tree game, the cost of a service delivered, by a source has to be allocated between homogeneous users at the vertices. But, modern networks have also the capacity to...

Minimum-cost spanning tree problems are well-known problems in the operations research literature. Some agents, located at different geographical places, want a service provided by a common supplier. Agents will be served through costly connections. Some part of the literature has focused,...