matching, a stable set is defined as the union of the core of the game and the core of the subgames that are compatible with … usually defined on the core. …

In this paper, we study different notions of stability for three-sided assignment games. Since the core may be empty in …-Morgenstern stable sets. The dominant diagonal property is necessary for the core to be a stable set, and also sufficient in the case … of the extended cores of all μ-compatible subgames, for a given optimal matching μ, is the core with respect to those …

In this paper, we study different notions of stability for three-sided assignment games. Since the core may be empty in …-Morgenstern stable sets. The dominant diagonal property is necessary for the core to be a stable set, and also sufficient in the case … of the extended cores of all μ-compatible subgames, for a given optimal matching μ, is the core with …