uses the fact that the core of an associated compensation matching game with constraints is nonempty. …In this paper we consider one-to-many matching problems where the preferences of the agents involved are represented by … matching to a matching of maximum total reward, one can always provide a compensation schedule that will be ex-post stable in …

shown that the core of a TU-game coincides with the core of the corresponding minimal rights game. Moreover, the paper … introduces the notion of the k-core cover as an extension of the core cover. The k-core cover of a TU-game consists of all … minimal rights game. It is shown that the core of a TU-game with player set N coincides with the ? …

-emptiness of the strong core and the second domain restriction ensures non-emptiness of the weak core of the corresponding hedonic … games. Moreover, an element of the strong core under friends appreciation can be found in polynomial time, while finding an … element of the weak core under enemies aversion is NP-hard. We examine also the relationship between our domain restrictions …

merge convex and ordinal convex. Generalizing the notions of core cover and compromise stability for transferable utility …