Showing 1 - 9 of 9
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
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/10011257257
In the literature, there exist several models where a cooperative TU-game is enriched with a hierarchical structure on the player set that is represented by a digraph. We consider games under precedence constraints introduced by Faigle and Kern (1992) who also introduce a generalization of the...
Persistent link: https://www.econbiz.de/10011255563
A situation in which a finite set of agents can generate certain payoffs by cooperation can be described by a cooperative game with transferable utility (or simply a TU-game) where each agent is represented by one player in the game. In this paper, we assume that one agent can be represented by...
Persistent link: https://www.econbiz.de/10011255881
This discussion paper led to a publication in 'Theory and Decision', 2008, 64, 519-536. 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,...
Persistent link: https://www.econbiz.de/10011256099
merge convex and ordinal convex. Generalizing the notions of core cover and compromise stability for transferable utility …
Persistent link: https://www.econbiz.de/10011256320
There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...
Persistent link: https://www.econbiz.de/10011256471
Agents participating in different kind of organizations, usually take different positions in some relational structure. The aim of this paper is to introduce a new framework taking into account both communication and hierachical features derived from this participation. In fact, this new set or...
Persistent link: https://www.econbiz.de/10011256706
This discussion paper resulted in a publication in 'Theory and Decision', 2014, 76, 343-361.<P> It is known that peer group games are a special class of games with a permission structure. However, peer group games are also a special class of (weighted) digraph games. To be specific, they are...</p>
Persistent link: https://www.econbiz.de/10011257309