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

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

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

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

By generalizing the standard solution for 2-person games into n-person cases, this paper develops a new solution concept for cooperative games: the consensus value.We characterize the consensus value as the unique function that satisfies efficiency, symmetry, the quasi dummy property and...

AMS classification: 90D12

A competition which is based on the results of (partial) pairwise comparisons can be modelled by means of a directed graph.Given initial weights on the nodes in such digraph competitions, we view the measurement of the importance (i.e., the cardinal ranking) of the nodes as an allocation problem...