We prove a theorem on the intersection of the Weber sets (Weber, 1988) of two ordered cooperative games. From this theorem several consequences are derived, the inclusion of the core in the Weber set (Weber, 1988), the fact that every convex game has a large core (Sharkey, 1982), and a discrete...

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

A matrix A defines an assignment market, where each row represents a buyer and each column a seller. If buyer i is matched with seller j, the market produces aij units of utility. Quint (1991) points out that usually many different assignment matrices exist that define markets with the same core...