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

We introduce the aggregate-monotonic core as the set of allocations of a transferable utility cooperative game attainable by single-valued solutions that satisfy core-selection and aggregate-monotonicity. We provide a necessary and sufficient condition for the coincidence of the core and the...

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