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 ⌊|N |/2⌋-core cover …

allowing all its members to get the service that generates the revenues. We focus on the study of the core of cost … consideration to all its members, it is shown that a cost-revenue game has a non-empty core for any vector of revenues if, and only … if, the dual game of the cost game has a large core. Using this result, we investigate minimum cost spanning tree games …

coalitions also their union is feasible. Properties of solutions (the core, the nucleolus, the prekernel and the Shapley value …

-convexity, under which the game is shown to have a non-empty core and the average tree solution lies in the core. In general, link …

the unique welfare distribution that is core-stable and satisfies the condition that no agent gets a utility payoff above … has an increasing benefit function (no externalities) then every weighted hierarchical solution is core-stable. In case of …

allowing all its members to get the service that generates the revenues. We focus on the study of the core of cost … consideration to all its members, it is shown that a cost-revenue game has a non-empty core for any vector of revenues if, and only … if, the dual game of the cost game has a large core. Using this result, we investigate minimum cost spanning tree games …