all men acceptable, Sasaki and Toda (1992) characterize the core by anonymity, Pareto optimality, consistency, and … by characterizing the core on the domain of no odd rings roommate markets by individual rationality, anonymity, Pareto …

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 …

) blocking dynamics in two-sided one-to-one matching markets with continuous side payments (assignment problems, Shapley and … obtained from the previous one by satisfying a blocking pair (i.e., by matching the two blocking agents and assigning new … the model (i.e., for marriage markets, one-to-one matching, or discretized assignment problems), the existence of blocking …

) blocking dynamics in two-sided one-to-one matching markets with continuous side payments (assignment problems, Shapley and … obtained from the previous one by satisfying a blocking pair (i.e., by matching the two blocking agents and assigning new … the model (i.e., for marriage markets, one-to-one matching, or discretized assignment problems), the existence of blocking …

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 …

The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal … called compromise stable if the core is equal to the core cover, i.e. the core is the convex hull of the larginal vectors. In … larginal vector of the set is a core element, then the game is compromise stable. The first characterization of these sets is …