IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v105y2017icp120-143.html
   My bibliography  Save this article

An approach to transportation network analysis via transferable utility games

Author

Listed:
  • Hadas, Yuval
  • Gnecco, Giorgio
  • Sanguineti, Marcello

Abstract

Network connectivity is an important aspect of any transportation network, as the role of the network is to provide a society with the ability to easily travel from point to point using various modes. A basic question in network analysis concerns how “important” each node is. An important node might, for example, greatly contribute to short connections between many pairs of nodes, handle a large amount of the traffic, generate relevant information, represent a bridge between two areas, etc. In order to quantify the relative importance of nodes, one possible approach uses the concept of centrality. A limitation of classical centrality measures is the fact that they evaluate nodes based on their individual contributions to the functioning of the network. The present paper introduces a game theory approach, based on cooperative games with transferable utility. Given a transportation network, a game is defined taking into account the network topology, the weights associated with the arcs, and the demand based on an origin-destination matrix (weights associated with nodes). The network nodes represent the players in such a game. The Shapley value, which measures the relative importance of the players in transferable utility games, is used to identify the nodes that have a major role. For several network topologies, a comparison is made with well-known centrality measures. The results show that the suggested centrality measures outperform the classical ones, and provide an innovative approach for transportation network analysis.

Suggested Citation

  • Hadas, Yuval & Gnecco, Giorgio & Sanguineti, Marcello, 2017. "An approach to transportation network analysis via transferable utility games," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 120-143.
  • Handle: RePEc:eee:transb:v:105:y:2017:i:c:p:120-143
    DOI: 10.1016/j.trb.2017.08.029
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261517302540
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2017.08.029?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hadas, Yuval, 2013. "Assessing public transport systems connectivity based on Google Transit data," Journal of Transport Geography, Elsevier, vol. 33(C), pages 105-116.
    2. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    3. Mishra, Sabyasachee & Welch, Timothy F. & Jha, Manoj K., 2012. "Performance indicators for public transit connectivity in multi-modal transportation networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(7), pages 1066-1085.
    4. Maschler,Michael & Solan,Eilon & Zamir,Shmuel, 2013. "Game Theory," Cambridge Books, Cambridge University Press, number 9781107005488.
    5. Bell, Michael G. H., 2000. "A game theory approach to measuring the performance reliability of transport networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(6), pages 533-545, August.
    6. Laporte, Gilbert & Mesa, Juan A. & Perea, Federico, 2010. "A game theoretic framework for the robust railway transit network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 447-459, May.
    7. Hadas, Yuval & Ranjitkar, Prakash, 2012. "Modeling public-transit connectivity with spatial quality-of-transfer measurements," Journal of Transport Geography, Elsevier, vol. 22(C), pages 137-147.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhu, Zhenran & Zhang, Anming & Zhang, Yahua & Huang, Zhibin & Xu, Shiteng, 2019. "Measuring air connectivity between China and Australia," Journal of Transport Geography, Elsevier, vol. 74(C), pages 359-370.
    2. Dennis Gaus & Georg Hirte, 2023. "Agglomeration or Market Access? The Defining Factors of Firms' Location Choice," Discussion Papers of DIW Berlin 2045, DIW Berlin, German Institute for Economic Research.
    3. Aziz, Furqan & Gul, Haji & Muhammad, Ishtiaq & Uddin, Irfan, 2020. "Link prediction using node information on local paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 557(C).
    4. Gusev, Vasily V., 2020. "The vertex cover game: Application to transport networks," Omega, Elsevier, vol. 97(C).
    5. Dai, Zhuang & Liu, Xiaoyue Cathy & Chen, Zhuo & Guo, Renyong & Ma, Xiaolei, 2019. "A predictive headway-based bus-holding strategy with dynamic control point selection: A cooperative game theory approach," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 29-51.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liu, Chengliang & Duan, Dezhong, 2020. "Spatial inequality of bus transit dependence on urban streets and its relationships with socioeconomic intensities: A tale of two megacities in China," Journal of Transport Geography, Elsevier, vol. 86(C).
    2. Dimitrov, Stavri Dimitri & Ceder, Avishai (Avi), 2016. "A method of examining the structure and topological properties of public-transport networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 373-387.
    3. Zhou, Yaoming & Wang, Junwei & Sheu, Jiuh-Biing, 2019. "On connectivity of post-earthquake road networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 1-16.
    4. Giulia Cesari & Roberto Lucchetti & Stefano Moretti, 2017. "Generalized additive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 919-939, November.
    5. Rahimi-Golkhandan, Armin & Garvin, Michael J. & Brown, Bryan L., 2019. "Characterizing and measuring transportation infrastructure diversity through linkages with ecological stability theory," Transportation Research Part A: Policy and Practice, Elsevier, vol. 128(C), pages 114-130.
    6. (Ato) Xu, Wangtu & Zhou, Jiangping & Yang, Linchuan & Li, Ling, 2018. "The implications of high-speed rail for Chinese cities: Connectivity and accessibility," Transportation Research Part A: Policy and Practice, Elsevier, vol. 116(C), pages 308-326.
    7. Szeto, W.Y. & Farahani, R.Z. & Sumalee, Agachai, 2017. "Link-based multi-class hazmat routing-scheduling problem: A multiple demon approach," European Journal of Operational Research, Elsevier, vol. 261(1), pages 337-354.
    8. Jinjoo Bok & Youngsang Kwon, 2016. "Comparable Measures of Accessibility to Public Transport Using the General Transit Feed Specification," Sustainability, MDPI, vol. 8(3), pages 1-13, March.
    9. Rodríguez-Núñez, Eduardo & García-Palomares, Juan Carlos, 2014. "Measuring the vulnerability of public transport networks," Journal of Transport Geography, Elsevier, vol. 35(C), pages 50-63.
    10. Phuoc Hoang Le & Tri-Dung Nguyen & Tolga Bektaş, 2016. "Generalized minimum spanning tree games," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 167-188, May.
    11. Cheng, Yung-Hsiang & Chen, Ssu-Yun, 2015. "Perceived accessibility, mobility, and connectivity of public transportation systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 77(C), pages 386-403.
    12. Zhang, Liye & Xiao, Zhe & Ren, Shen & Qin, Zheng & Goh, Rick Siow Mong & Song, Jie, 2022. "Measuring the vulnerability of bike-sharing system," Transportation Research Part A: Policy and Practice, Elsevier, vol. 163(C), pages 353-369.
    13. Sharma, Ishant & Mishra, Sabyasachee & Golias, Mihalis M. & Welch, Timothy F. & Cherry, Christopher R., 2020. "Equity of transit connectivity in Tennessee cities," Journal of Transport Geography, Elsevier, vol. 86(C).
    14. Zhou, Yueer & Li, Linbo & Zhang, Yahua, 2023. "Location of transit-oriented development stations based on multimodal network equilibrium: Bi-level programming and paradoxes," Transportation Research Part A: Policy and Practice, Elsevier, vol. 174(C).
    15. Chia, Jason & Lee, Jinwoo (Brian), 2020. "Extending public transit accessibility models to recognise transfer location," Journal of Transport Geography, Elsevier, vol. 82(C).
    16. Hu, Xinlei & Huang, Jie & Shi, Feng, 2019. "Circuity in China's high-speed-rail network," Journal of Transport Geography, Elsevier, vol. 80(C).
    17. Yang, Zhisen & Yang, Zaili & Yin, Jingbo & Qu, Zhuohua, 2018. "A risk-based game model for rational inspections in port state control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 477-495.
    18. Hadas, Yuval, 2013. "Assessing public transport systems connectivity based on Google Transit data," Journal of Transport Geography, Elsevier, vol. 33(C), pages 105-116.
    19. Guang Zhang & Erfang Shan & Liying Kang & Yanxia Dong, 2017. "Two efficient values of cooperative games with graph structure based on $$\tau $$ τ -values," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 462-482, August.
    20. Sylvain Béal & Marc Deschamps & Catherine Refait-Alexandre & Guillaume Sekli, 2022. "Early contributors, cooperation and fair rewards in crowdfunding," Working Papers hal-04222321, HAL.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:105:y:2017:i:c:p:120-143. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.