The 'marriage game': An assignment problem with indivisibilities (Q791450)

A problem is considered of the assignment of two types of objects in pairs of partners, when it is assumed that each object has preferences with respect to the choice of a partner, and the two types of objects are available in equal numbers. The model is applicable to, for instance, the marriage problem, or to the assignment of offices of a company to locations. The existence of a core of the game is demonstrated and a uniqueness condition is given. The maximum number of core allocations is examined when the core is not uniquely determined.