The article of record as published may be found at http://dx.doi.org/10.1016/j.ejor.2007.06.040We introduce in this work an extension of the model of games with probabilistic graphs arising in Calvo et al. (1999, Math. Soc. Sci. 37, 79), which itself generalizes the one developed by Myerson (1977, Math. of Oper. Res. 2, 225) for games with communications restrictions. In the first of these models, each pair of nodes has a given probability of direct communication. In this paper a more general setting is considered: we suppose that a probability distribution over the set of all possible communication networks among the players is given. A generalization of the Myerson value is defined and characterized in this context.Plan Nacional de I...
Standard approaches to model interaction networks are limited in their capacity to describe the nuan...
We present a new characterization of the position value, one of the most prominent allocation rules ...
This paper analyzes t he probabilistic Harsanyi power solutions (PHPSs) for probabilistic graph game...
In this article, we generalize the position value, defined by Meessen (1988) for the class of determ...
We study values for transferable utility games enriched by a communication graph (CO-games) where th...
Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly ta...
summary:A probabilistic communication structure considers the setting with communication restriction...
Most previous works study the evolution of cooperation in a structured population by commonly employ...
In this paper we introduce an extension of the model of restricted communication in cooperative game...
International audienceMost allocation rules for network games presented in the literature assume tha...
Cette thèse traite de l’analyse théorique et l’application d’une nouvelle famille de jeux coopératif...
In a restructured power market, the network cost is to be allocated between multiple players utilizi...
In this work we consider hypergraph communication situations where for a group of actors the economi...
Abstract—Opportunistic networking is an important technique to enable users to communicate in an env...
In this paper, we generalize the notion of a communication equilibrium (Forges 1986, Myerson 1986) o...
Standard approaches to model interaction networks are limited in their capacity to describe the nuan...
We present a new characterization of the position value, one of the most prominent allocation rules ...
This paper analyzes t he probabilistic Harsanyi power solutions (PHPSs) for probabilistic graph game...
In this article, we generalize the position value, defined by Meessen (1988) for the class of determ...
We study values for transferable utility games enriched by a communication graph (CO-games) where th...
Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly ta...
summary:A probabilistic communication structure considers the setting with communication restriction...
Most previous works study the evolution of cooperation in a structured population by commonly employ...
In this paper we introduce an extension of the model of restricted communication in cooperative game...
International audienceMost allocation rules for network games presented in the literature assume tha...
Cette thèse traite de l’analyse théorique et l’application d’une nouvelle famille de jeux coopératif...
In a restructured power market, the network cost is to be allocated between multiple players utilizi...
In this work we consider hypergraph communication situations where for a group of actors the economi...
Abstract—Opportunistic networking is an important technique to enable users to communicate in an env...
In this paper, we generalize the notion of a communication equilibrium (Forges 1986, Myerson 1986) o...
Standard approaches to model interaction networks are limited in their capacity to describe the nuan...
We present a new characterization of the position value, one of the most prominent allocation rules ...
This paper analyzes t he probabilistic Harsanyi power solutions (PHPSs) for probabilistic graph game...