This paper studies the nucleolus of graph-restricted games as an alternative for the Shapley value to evaluate communication situations. We focus on the inheritance of properties of cooperative games related to the nucleolus: balancedness (the nucleolus is in the core), compromise stability and strong compromise admissibility (these properties allow for a direct, closed formula for the nucleolus). We characterize the families of graphs for which the graph-restricted games inherit these properties from the underlying games. Moreover, for each of these properties, we characterize the family of graphs for which the nucleolus is invariant
A situation in which a finite set of players can obtain certain payoffs by cooperation can be descri...
We consider cooperative transferable utility games, or simply TU-games, with limited com-munication ...
We consider classes of cooperative games. We show that we can efficiently compute an allocation in t...
This paper studies the nucleolus of graph-restricted games as an alternative for the Shapley value t...
In this paper we consider cooperative games in which the possibilities for cooperation between the p...
A situation in which a finite set of players can obtain certain payoffs by cooperation can be descri...
We introduce a new family of cooperative games for which there is coincidence between the nucleolus ...
We introduce a new family of cooperative games for which there is coincidence between the nucleolus ...
International audienceThe paper aims at generalizing the notion of restricted game on a communicatio...
Abstract: A new solution concept for cooperative transferable utility games is introduced, which is ...
The nucleon is introduced as a new allocation concept for non-negative cooperative n-person transfer...
The paper aims at generalizing the notion of restricted game on a communication graph, introduced by...
We consider cooperative transferable utility games, or simply TU-games, with limited communication s...
The nucleolus is a well-known solution concept for coalitional games to fairly distribute the total ...
It is well-known that the prenucleolus on the class of TU games is characterized by singlevaluedness...
A situation in which a finite set of players can obtain certain payoffs by cooperation can be descri...
We consider cooperative transferable utility games, or simply TU-games, with limited com-munication ...
We consider classes of cooperative games. We show that we can efficiently compute an allocation in t...
This paper studies the nucleolus of graph-restricted games as an alternative for the Shapley value t...
In this paper we consider cooperative games in which the possibilities for cooperation between the p...
A situation in which a finite set of players can obtain certain payoffs by cooperation can be descri...
We introduce a new family of cooperative games for which there is coincidence between the nucleolus ...
We introduce a new family of cooperative games for which there is coincidence between the nucleolus ...
International audienceThe paper aims at generalizing the notion of restricted game on a communicatio...
Abstract: A new solution concept for cooperative transferable utility games is introduced, which is ...
The nucleon is introduced as a new allocation concept for non-negative cooperative n-person transfer...
The paper aims at generalizing the notion of restricted game on a communication graph, introduced by...
We consider cooperative transferable utility games, or simply TU-games, with limited communication s...
The nucleolus is a well-known solution concept for coalitional games to fairly distribute the total ...
It is well-known that the prenucleolus on the class of TU games is characterized by singlevaluedness...
A situation in which a finite set of players can obtain certain payoffs by cooperation can be descri...
We consider cooperative transferable utility games, or simply TU-games, with limited com-munication ...
We consider classes of cooperative games. We show that we can efficiently compute an allocation in t...