Abstract.
A class of cooperative TU-games arising from shortest path problems is introduced and analyzed. Some conditions under which a shortest path game is balanced are obtained. Also an axiomatic characterization of the Shapley value for this class of games is provided.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Manuscript received: November 1999/Final version received: February 2000
Rights and permissions
About this article
Cite this article
Fragnelli, V., García-Jurado, I. & Méndez-Naya, L. On shortest path games. Mathematical Methods of OR 52, 251–264 (2000). https://doi.org/10.1007/s001860000061
Issue Date:
DOI: https://doi.org/10.1007/s001860000061