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 Böhm-Bawerk horse markets are assignment markets with homogeneous goods that are known to have a one-dimensional core. We show here that, although there exist two-sided assignment games with non-homogeneous products and with a segment as a core, the Böhm-Bawerk horse markets are the only...

We provide explicit formulas for the nucleolus of an arbitrary assignment game with two buyers and two sellers. Five different cases are analyzed depending on the entries of the assignment matrix. We extend the results to the case of 2 m or m 2 assignment games.

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

Convex cooperative games were first introduced by Shapley (Int J Game Theory 1:11–26, <CitationRef CitationID="CR11">1971</CitationRef>) while population monotonic allocation schemes (PMAS) were subsequently proposed by Sprumont (Games Econ Behav 2:378–394, <CitationRef CitationID="CR13">1990</CitationRef>). In this paper we provide several characterizations of convex games and...</citationref></citationref>