In this paper conditions are given guaranteeing that the Core equals the D-core (the set of unDominated imputations). Under these conditions, we prove the non-emptiness of the intersection of the Weber set with the imputation set. This intersection has a special stability property: it is externally stable. As a consequence we can give a new characterization (th. 3.2) for the convexity of a cooperative game in terms of its stability (von Neumann-Morgenstern solutions) using the Weber set.

Directed minimum cost spanning tree problems of a special kind are studied, namely those which show up in considering the problem of connecting units (houses) in mountains with a purifier. For such problems an easy method is described to obtain a minimum cost spanning tree. The related cost sharing problem is tackled by considering the corresponding cooperative cost game with the units as players and also the related connection games, for each unit one. The cores of the connection games have a simple structure and each core element can be extended to a population monotonic allocation scheme (pmas) and also to a bi-monotonie allocation scheme. These pmas-es for the connection games result in pmas-es for the cost game.

This paper discusses the core of the game corresponding to the standard fixed tree problem. We introduce the concept of a weighted constrained egalitarian solution. The core of the standard fixed tree game equals the set of all weighted constrained egalitarian solutions. The notion of home-down allocation is developed to create further insight in the local behavior of the weighted constrained egalitarian allocation. A similar and dual approach by the notion of down-home allocations gives us the class of weighted Shapley values. The constrained egalitarian solution is characterized in terms of a cost sharing mechanism.

Nash equilibria for strategic games were characterized by Peleg and Tijs (1996) as those solutions satisfying the properties of consistency, converse consistency and one-person rationality. There are other solutions, like the -Nash equilibria, which enjoy nice properties and appear to be interesting substitutes for Nash equilibria when their existence cannot be guaranteed. They can be characterized using an appropriate substitute of one-person rationality. More generally, we introduce the class of "personalized" Nash equilibria and we prove that it contains all of the solutions characterized by consistency and converse consistency.