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

This paper analyzes network problems with congestion effects from a cooperative game theoretic perspective. It is shown that for network problems with convex congestion costs, the corresponding games have a non-empty core. If congestion costs are concave, then the corresponding game has not...

This paper analyzes congestion effects on network situations from a cooperative game theoretic perspective. In network situations players have to connect themselves to a source. Since we consider publicly available networks any group of players is allowed to use the entire network to establish...