Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
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 form a join-semilattice with a finite number of minimal elements and a unique maximum. We provide a characterization of the minimal elements. A sufficient condition under which the join-semilattice reduces to a lattice is also given.