Premium
Some properties of transportation network cooperative games
Author(s) -
Gnecco Giorgio,
Hadas Yuval,
Sanguineti Marcello
Publication year - 2019
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21887
Subject(s) - shapley value , centrality , transferable utility , computer science , node (physics) , cooperative game theory , game theory , measure (data warehouse) , function (biology) , mathematical economics , non cooperative game , network theory , repeated game , mathematical optimization , mathematics , data mining , engineering , statistics , structural engineering , combinatorics , evolutionary biology , biology
A basic question in network analysis concerns the quantification of the importance of each node in terms of network connectivity. To this end, a possible approach consists in using cooperative game theory tools to define a measure of node centrality. In this paper, given a transportation network, a cooperative game model with transferable utility (TU game) is considered. The nodes of the network represent the players in such a game, and the Shapley values of the nodes are used to measure centrality. The model, called Transportation Network cooperative (TNc) game, integrates within the utility function of the TU game the network topology and the demand. Properties of TNc games and their associated utility functions are investigated. Numerical results are reported, to get insights into the obtained properties.