Showing 1 - 10 of 180
combinations of one and two person coalitions.Secondly it is shown that MLTS games with ¯ve or less players have a nonempty core ….However, a six player MLTS game may have an empty core.For the special instance where the reward between a pair of nodes is equal … to 0 or 1, we provide relations between the structure of the core and the underlying network. …
Persistent link: https://www.econbiz.de/10011090530
Persistent link: https://www.econbiz.de/10012194192
In this paper, we introduce a general framework for situations with decision making under uncertainty and cooperation possibilities. This framework is based upon a two stage stochastic programming approach. We show that under relatively mild assumptions the cooperative games associated with...
Persistent link: https://www.econbiz.de/10011090375
of all players, equal gain splitting rules are defined.It is shown that these rules lead to core elements of the …
Persistent link: https://www.econbiz.de/10011090690
Classification: JEL code C71
Persistent link: https://www.econbiz.de/10011090716
finds a core allocation in finitely many rounds. The core allocation consists of an assignment of the items and its …
Persistent link: https://www.econbiz.de/10011090743
AMS classification: 90D12; 03E72;
Persistent link: https://www.econbiz.de/10011090798
In this paper, we characterise the compromise value of a game as the barycentre of the edges of its core cover.For this …
Persistent link: https://www.econbiz.de/10011090909
solution for TU-games. Existence is proved for the class of convex games. Furthermore, the core of a postive valued convex game …
Persistent link: https://www.econbiz.de/10011090971
containing the (Shapley) share-core, the Banzhaf share-core and the Large Banzhaf share-core. We provide characterizations of …
Persistent link: https://www.econbiz.de/10011090996