A cooperative game approach to cost allocation in a rapid-transit network
place - north america, mode - subway/metro, economics - pricing
Game theory, Networks, Transportation, Shortest paths, Cost allocation
We consider the problem of allocating costs of a regional transit system to its users, who employ shortest path routes between all pairs of nodes in the system network. We provide an axiomatic set of conditions that a solution should satisfy and use cooperative game theory to model the cost allocation problem. We provide an allocation, called the equal cost share solution, which is efficient to compute and is the unique solution that satisfies the conditions. In addition, we show not only that the cost allocation game has a nonempty core, but further, that the game is concave, meaning that the Shapley value allocation, which coincides with the equal cost share solution, always lies in the core of the game. We provide an application of the equal cost share solution to the Washington, D.C. Metro transit network and compare it to the existing fare pricing structure. As compared to equal cost share pricing, the Metro overcharges for short downtown trips and undercharges for very long commutes. The equal cost share solution is easy to update in real time as the cost data and user distribution change, or when the transit network expands.
Permission to publish the abstract has been given by Elsevier, copyright remains with them.
Rosenthal, E.C. (2017). A cooperative game approach to cost allocation in a rapid-transit network. Transportation Research Part B: Methodological, Vol. 97, pp. 64–77.