We prove that both the nucleolus and the core-center, i.e., the mass center of the core, of an m-sided Böhm-Bawerk assignment market can be respectively computed from the nucleolus and the core-center of a convex game defined on the set of m sectors. What is more, in the calculus of the...

The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the...

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

The existence of von Neumann–Morgenstern solutions (stable sets) for assignment games has been an unsolved question since Shapley and Shubik (1972) [11]. For each optimal matching between buyers and sellers, Shubik (1984) [12] proposed considering the union of the core of the game and the core...

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

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