Values of games with weighted graphs Articles uri icon

authors

  • GONZÁLEZ ARANGUENA, ENRIQUE
  • CONRADO, MIGUEL MANUEL
  • POZO JUAN, MONICA

publication date

  • May 2015

start page

  • 248

end page

  • 257

issue

  • 1

volume

  • 243

International Standard Serial Number (ISSN)

  • 0377-2217

Electronic International Standard Serial Number (EISSN)

  • 1872-6860

abstract

  • 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 weight 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 maintaining the communication link or even probability of the relation (as in Calvo, Lasaga, and van den Noweland, 1999). Then, according to the different interpretations, we introduce several point solutions for these restricted games in a way parallel to the familiar environment of Myerson. Finally, we characterize these values in terms of the (adapted) component efficiency, fairness and balanced contributions properties and we analyze the extent to which they satisfy a link/weight monotonicity property. (C) 2014 Elsevier B.V. All rights reserved.