RT Journal Article
T1 Values of games with weighted graphs
A1 González Arangüena, Enrique
A1 Manuel García, Conrado Miguel
A1 Pozo, Mónica del
A2 Borgonovo, E.
AB In this paper we deal with TU games in which cooperation is restricted by means of a weighted network. We admit several interpretations for the weights of a link: capacity of the communication channel, flow across it, intimacy or intensity in the relation, distance between both incident nodes/players, cost of building or main-taining the communication link or even probability of the relation (as in Calvo et al., 1999). Then, accordingly with the different interpretations, we introduce several point solutions for these restricted games in a parallel way to the familiar environ of Myerson. Finally, we characterize these values in terms of the (adapted) component efficiency, fairness and balanced contributions properties and we analyze the extend to which they satisfy the stability property.
PB Elsevier
SN 0377-2217
YR 2015
FD 2015-05-16
LK https://hdl.handle.net/20.500.14352/102139
UL https://hdl.handle.net/20.500.14352/102139
LA eng
NO González-Arangüena, E., Manuel, C. M., & del Pozo, M. (2015). Values of games with weighted graphs. European Journal of Operational Research, 243(1), 248–257.
NO Spanish Government. Plan Nacional de I+D+i
DS Docta Complutense
RD 8 abr 2025