Showing 1 - 6 of 6
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
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
merge convex and ordinal convex. Generalizing the notions of core cover and compromise stability for transferable utility …
Persistent link: https://www.econbiz.de/10010250500
A symmetric network consists of a set of positions and a set of bilateral links between these positions. Examples of such networks are exchange networks, communication networks, disease transmission networks, control networks etc. For every symmetric network we define a cooperative transferable...
Persistent link: https://www.econbiz.de/10011343952
Persistent link: https://www.econbiz.de/10002982808
Persistent link: https://www.econbiz.de/10000912268