Showing 1 - 10 of 832
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 …
Persistent link: https://www.econbiz.de/10010373726
Assume that players strictly rank each other as coalition partners. We propose a procedure whereby they 'fall back' on their preferences, yielding internally compatible, or coherent, majority coalition(s), which we call fallback coalitions. If there is more than one fallback coalition, the...
Persistent link: https://www.econbiz.de/10013157458
A new bargaining set based on notions of both internal and external stability is developed in the context of endogenous coalition formation. It allows to make an explicit distinction between within-group and outside-group deviation options. This type of distinction is not present in current...
Persistent link: https://www.econbiz.de/10012733871
Assume that players strictly rank each other as coalition partners. We propose a procedure whereby they "fall back" on their preferences, yielding internally compatible, or coherent, majority coalition(s), which we call fallback coalitions. If there is more than one fallback coalition, the...
Persistent link: https://www.econbiz.de/10008810998
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 …
Persistent link: https://www.econbiz.de/10010491315
Gale and Shapley (1962) proposed the deferred-acceptance algorithm for matching (i) college applicants and colleges and … always Pareto-optimal: No other matching is at least as good for all the players and better for one or more. If there are …
Persistent link: https://www.econbiz.de/10013079383
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 …
Persistent link: https://www.econbiz.de/10011257556
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 …
Persistent link: https://www.econbiz.de/10011381991
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 …
Persistent link: https://www.econbiz.de/10010224779
A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the...
Persistent link: https://www.econbiz.de/10011376532