A value for generalized probabilistic communication situations

Abstract

We 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