In this paper we characterize convex games by means of Owen's multilinear extension and the marginal worth vectors associated with even or odd permutations. Therefore we have obtained a refinement of the classic theorem; Shapley (1971), Ichiishi (1981) in order to characterize the convexity of a...

To any assignment market we associate the unique exact assignment game defined on the same set of agents and with a core that is a translation of the core of the initial market. As it happens with the core, the kernel and the nucleolus of an assignment game are proved to be the translation of...

The monotonic core of a cooperative game with transferable utility 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, with and without restricted cooperation, associated to the initial game.

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

In the framework of bilateral assignment games, we study the set of matrices associated with assignment markets with the same core. We state conditions on matrix entries that ensure that the related assignment games have the same core. We prove that the set of matrices leading to the same core...

On the domain of two-sided assignment markets, the nucleolus is axiomatized as the unique solution that satisfies derived consistency (Owen, 1992) and complaint mono- tonicity on sectors size. As a consequence, we obtain a geometric characterization of the nucleolus by means of a strong form of...

The purpose of this paper is to generalize the theory of "equal share analysis", developed by Selten in 1972, to the one in which every player has a positive weight. We show that for any positive vector of weights, it is always possible to find a coalition structure and a payoff vector forming a...

Existence of von NeumannMorgenstern solutions (stable sets) is proved for any assignment game. For each optimal matching, a stable set is defined as the union of the core of the game and the core of the subgames that are compatible with this matching. All these stable sets exclude third-party...

We introduce a subclass of multi-sided assignment games that embodies markets with different types of firms that produce different types of homogeneous goods. These markets generalize bilateral Bohm-Bawerk horse markets. We describe the geometric and algebraic structure of the core, which is...