Cooperative TU-games with large core were introduced by Sharkey (1982) and the concept of Population Monotonic Allocation Scheme was defined by Sprumont (1990). Linking these two concepts, Moulin (1990) introduces the notion of large monotonic core giving a characterization for three-player...

We study the behaviour of the extreme points of the core of a game in front of the reduction of the game and prove that the extreme core points have the reduced game property but not the converse reduced game property. Nevertheless we give some sufficient conditions on an extreme point of the...

We study under which conditions the core of a game involved in a convex decomposition of another game turns out to be a stable set of the decomposed game. Some applications and numerical examples, including the remarkable Lucas five player game with a unique stable set different from the core,...

A subclass of games with population monotonic allocation schemes is studied, namely games with regular population monotonic allocation schemes (rpmas). We focus on the properties of these games and we prove the coincidence between the core and both the Davis-Maschler bargaining set and the...

We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with nonnegative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of...

Although assignment games are hardly ever convex, in this paper a characterization of their set or extreme points of the core is provided, which is also valid for the class of convex games. For each ordering in the player set, a payoff vector is defined where each player receives his marginal...

We extend Rochfords (1983) notion of symmetrically pairwise-bargained equilibrium to assignment games with more than two sides. A symmetrically multilateral-bargained (SMB) allocation is a core allocation such that any agent is in equilibrium with respect to a negotiation process among all...

We characterize single-valued solutions of transferable utility cooperative games satisfying core selection and aggregate monotonicity. Fur- thermore, we show that these two properties are compatible with individual rationality, the dummy player property and the symmetry property. We nish...

This paper presents a characterization of the non-emptiness of the intersection between the imputation set and the Weber set. Tools from non-cooperative zero-sum finite games are used. We assign a matrix game to any cooperative game and the sign of the value of this matrix game is used for the...

The monotonic core of a cooperative game with transferable utility (T.U.-game) is the set formed by all its Population Monotonic Allocation Schemes. In this paper we show that this set always coincides with the core of a certain game associated to the initial game.