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 …

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy …-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that …

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

.Attention is focused on how to divide the total reward (penalty) among the activities: the core of a correspondingcooperative … nonemptiness of the core of project games. …