Values of games with weighted graphs

• Autores: Enrique González Arangüena, Conrado Miguel Manuel García, Mónica del Pozo Juan
• Localización: Cuadernos de Trabajo de la Facultad de Estudios Estadísticos, ISSN 1989-0567, ISSN-e 2341-2550, Nº. 2, 2014, págs. 1-25
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • 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.