Showing 1 - 8 of 8
We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom compares for every component in the communication graph the total payoff to the players of...
Persistent link: https://www.econbiz.de/10010325828
We introduce an Owen-type value for games with two-level communication structures, being structures where the players are partitioned into a coalition structure such that there exists restricted communication between as well as within the a priori unions of the coalition structure. Both types of...
Persistent link: https://www.econbiz.de/10010326497
In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we...
Persistent link: https://www.econbiz.de/10010326524
This paper analyzes the 1-nucleolus and, in particular, its relation to the nucleolus and compromise value. It is seen … that the 1-nucleolus of a cooperative game can be characterized using a combination of standard bankruptcy rules for … associated bankruptcy problems. In particular, for any zero-normalized balanced game, the 1-nucleolus coincides with the Aumann …
Persistent link: https://www.econbiz.de/10011403580
distribution to every TU-game. A well-known solution is the nucleolus. A cooperative game with a permission structure describes a … provide a polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with …
Persistent link: https://www.econbiz.de/10010325689
coalitions also their union is feasible. Properties of solutions (the core, the nucleolus, the prekernel and the Shapley value …
Persistent link: https://www.econbiz.de/10010325691
distribution to every TU-game. A well-known solution is the nucleolus. A cooperative game with a permission structure describes a … computing the nucleolus of every restricted game corresponding to some disjunctive non-negative additive game with an acyclic …
Persistent link: https://www.econbiz.de/10010325798
individual compensations, and one about case-system consistency. This unique compensation scheme is the nucleolus of an …
Persistent link: https://www.econbiz.de/10011526119