Quant, Marieke; Reijnierse, Hans - Tilburg University, Center for Economic Research - 2004
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...