Abstract

A game-theoretic approach based on the framework of transferable-utility cooperative games is developed to assess the reliability of transfer nodes in public transportation networks in the case of stochastic transfer times. A cooperative game is defined, whose model takes into account the public transportation system, the travel times, the transfers and the associated stochastic transfer times, and the users’ demand. The transfer stops are modeled as the players of such a game, and the Shapley value – a solution concept in cooperative game theory – is used to identify their centrality and relative importance. Theoretical properties of the model are analyzed. A two-level Monte Carlo approximation of the vector of Shapley values associated with the nodes is introduced, which is efficient and able to take into account the stochastic features of the transportation network. The performance of the algorithm is investigated, together with that of its distributed computing variation. The usefulness of the proposed approach for planners and policy makers is shown with a simple example and on a case study from the public transportation network of Auckland, New Zealand. • A stochastic transferable utility game variation is introduced to assess transfers. • Uncertainty is realized by additional waiting time whenever a transfer is missed. • The approach assess transfer’ reliability effect on the network performance. • An efficient bi-level Monte Carlo approximation is developed. • A real-world public transportation network is analyzed.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call