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

In this paper we characterize the class of games for which the core coincides with the core cover (compromise stable games).Moreover we will develop an easy explicit formula for the nucleolus for this class of games, using an approach based on bankruptcy problems.Also the class of convex...