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

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

The problem of financing a set of public goods (facilities, projects) by private contri- butions is studied. The corresponding cooperative game, the realization game, is shown to be convex. For the noncooperative setting we study a realization scheme that induces a strategic game. This...

The T -measure is introduces as a method to rank the nodes in a digraph competition.It coincides with the T -value of an associated transferable utility game, the so-called digraph game.The T -measure is characterized in two ways.One of them is based on a characterization of the T -value in...

In this paper standard oligopolies are interpreted in two ways, namely as oligopolies without transferable technologies and as oligopolies with transferable technologies.From a cooperative point of view this leads to two different classes of cooperative games.We show that cooperative oligopoly...

This paper introduces fixed tree games with repeated players (FRP games) which are a generalization of standard fixed tree games.This generalization consists in allowing players to be located in more than one vertex.As a consequence, these players can choose among several ways of connection with...

A highway problem is determined by a connected graph which provides all potential entry and exit vertices and all possible edges that can be constructed between vertices, a cost function on the edges of the graph and a set of players, each in need of constructing a connection between a specific...

AMS classifications: 90D12, 90B05.