A cooperative game approach to cost allocation in a rapid-transit network
- 1 March 2017
- journal article
- Published by Elsevier BV in Transportation Research Part B: Methodological
- Vol. 97, 64-77
- https://doi.org/10.1016/j.trb.2016.11.014
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Discomfort in mass transit and its implication for scheduling and pricingTransportation Research Part B: Methodological, 2015
- Sharing costs in highways: A game theoretic approachEuropean Journal of Operational Research, 2013
- Optimal Allocation of Protective Resources in Shortest-Path NetworksTransportation Science, 2011
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanismsEuropean Journal of Operational Research, 2010
- On shortest path gamesMathematical Methods of Operations Research, 2000
- Minimum cost spanning tree gamesMathematical Programming, 1981
- On cost allocation for a spanning tree: A game theoretic approachNetworks, 1976
- ALL SHORTEST ROUTES IN A GRAPHPublished by Defense Technical Information Center (DTIC) ,1966
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959