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 optimal is provided …

Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network … structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of … alternative network structures (not just sub-networks) can and should influence the allocation of value among players on any given …

Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network … structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of … alternative network structures (not just sub-networks) can and should influence the allocation of value among players on any given …

membership M and p(i; j) = p(j; i) = 0 if ij is not an element of M. The pair (M; p) is called a solution. A pair of players i; j …