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

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

Covert organizations are constantly faced with a tradeoff between secrecy and operational effciency. Lindelauf, Borm and Hamers (2008) developed a theoretical framework to determine optimal homogeneous networks taking the above mentioned considerations explicitly into account. In this paper this...

In order to be able to devise successful strategies for destabilizing terrorist organizations it is vital to recognize and understand their structural properties. This paper deals with the optimal communication structure of terrorist organizations when considering the tradeoff between secrecy...