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 …

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 L|N |/2-̦core cover …

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