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 …

-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 …

-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 …

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 ? …

ones. We then define the balanced-core as a refinement ofthe core. A payoff vector lies in the balanced-core if it lies in … the core andthe payoff vector is an element of payoff sets of all graphs in some balanced collection ofgraphs. We prove … that any balanced graph game has a nonempty balanced-core.We conclude by some examples showing the usefulness of the …

of players. The social structure is utilized to refine the core of the game. For every coalition the relative strength of … stable core is the set of socially stable elements of the core. We show that the socially stable core is non-empty if the … game itself is socially stable. In general the socially stable core consists of a finite number of faces of the core and …

the players whose link is deleted face the same loss in payoff. The component fairness solution is always in the core of …

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