We introduce the class of Obligation rules for minimum cost spanning tree situations.The main result of this paper is that such rules are cost monotonic and induce also population monotonic allocation schemes.Another characteristic of Obligation rules is that they assign to a minimum cost...

Finding the lexicographic maximum of a polytope in Rn can be achieved by solving a suitable LP-problem.

The class of neighbour games is the intersection of the class of assignment games (cf. Shapley and Shubik (1972)) and the class of component additive games (cf. Curiel et al. (1994)). For assignment games and component additive games there exist polynomially bounded algorithms of order p4 for...

Under some weakenings of the condition of the well-known fixed point theorems of Brouwer, Kakutani and Banach the existence of approximate fixed points turns out to be still guaranteed. Also an approximate fixed point theorem is given for certain nonexpansive maps.

AMS classification: 91A12

In this paper reasonable payoff intervals for players in a game in partition function form (p.f.f.game) are introduced and used to define the notion of compromisable p.f.f. game.For a compromisable p.f.f. game a compromise value is defined for which an axiomatic characterization is provided.Also...

Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper generalizes the definition of irreducible core to minimum cost spanning extension problems and introduces...

Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbour games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component...