We show that the family of assignment matrices which give rise to the same nucleolus forms a compact join-semilattice with one maximal element. The above family is in general not a convex set, but path-connected

We analyze assortative multisided assignment games, following Sherstyuk (1999) and Martínez-de-Albéniz et al. (2019). In them players' abilities are complementary across types (i.e. supermodular), and also the output of the essential coalitions is increasing depending on types. We study the...

We show that the family of assignment matrices which give rise to the same nucleolus form a compact join-semilattice with one maximal element, which is always a valuation (see p.43, Topkis (1998)). We give an explicit form of this valuation matrix. The above family is in general not a convex...