Showing 1 - 10 of 543
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
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
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
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
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
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 …
Persistent link: https://www.econbiz.de/10014181798
merge convex and ordinal convex. Generalizing the notions of core cover and compromise stability for transferable utility …
Persistent link: https://www.econbiz.de/10010250500
cooperative games with transferable utility. This notion is used to axiomatically characterize the core on the domain of convex … value, (b) all homothetic images of the core with the Shapley value as center of homothety and with positive ratios of …
Persistent link: https://www.econbiz.de/10012824091
of coalitions are explicitly taken into account. We formulate conditions under which it leads to a core element and …
Persistent link: https://www.econbiz.de/10012957744
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 …
Persistent link: https://www.econbiz.de/10014038137