Some properties of transportation network cooperative games. Issue 2 (17th April 2019)

• Record Type: Journal Article
• Authors: Gnecco, Giorgio; Hadas, Yuval; Sanguineti, Marcello
• Is Part Of: Networks. Volume 74:Issue 2(2019)
• Page Start: 161
• Page End: 173
• Publication Date: 2019-04-17
• Subjects: centrality measures -- games on graphs -- network analysis -- Shapley value -- transferable utility games; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21887
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract: 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.