Singlevalued solutions for the case of twosided market games without product differentiation, also known as B ohmBawerk horse market games, are analyzed. The nucleolus is proved to coincide with the value, and is thus the midpoint of the core. Moreover a characterization of this set of games in...

This paper provides an axiomatic framework to compare the D-core (the set of undominated imputations) and the core of a cooperative game with transferable utility. Theorem 1 states that the D-core is the only solution satisfying projection consistency, reasonableness (from above),...

The paper deals with the subclass of k-convex n-person transferable utility games which have clear affinities to the well-known convex TU-games. Five new characterizations of a k-convex n-person TU-game are presented in terms of: (1) the unanimity coordinates of TU-game with respect to 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...

In the assignment game framework, we try to identify those assignment matrices in which no entry can be increased without changing the core of the game. These games will be called buyerseller exact games and satisfy the condition that each mixedpair coalition attains the corresponding matrix...

Different propietats of convex and average convex games are developed in terms of unanimity coordinates. A set of necessary and sufficient conditions for the core of balanced games containing the Shapley value are given. Connections between convexity and average convexity, the Shapley value, the...

A static comparative study on set-solutions for cooperative TU games is carried out. The analysis focuses on studying the compatibility between two classical and reasonable properties introduced by Young (1985) in the context of single valued solutions, namely core-selection and coalitional...

In the context of cooperative TU-games, and given an order of players, we consider the problem of distributing the worth of the grand coalition as a sequential decision problem. In each step of the process, upper and lower bounds for the payoff of the players are required related to successive...

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

There exist coalitional games with transferable utility which have the same core but different nucleoli. We show that this cannot happen in the case of assignment games. Whenever two assignment games have the same core, their nucleoli also coincide. To show this, we prove that the nucleolus of...