This paper analyzes convex congestion network problems. It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore, an easy way of determining if a given network is...

A symmetric network consists of a set of positions and a set of bilateral links between these positions. Examples of such networks are exchange networks, communication networks, disease transmission networks, control networks etc. For every symmetric network we define a cooperative transferable...

We consider the problem of computing the influence of a neuronal structure in a brain network. Abraham, Kotter, Krumnack, and Wanke (2006) computed this influence by using the Shapley value of a coalitional game corresponding to a directed network as a rating. Kotter, Reid, Krumnack, Wanke, and...

This paper introduces a framework for joint hub network development. Building a joint physical hub for transhipment of goods is expensive and therefore involves considerable risks for the cooperating companies. In a practical setting, it is unlikely that an entire network will be built at once....