On shortest path games
From MaRDI portal
Publication:1397689
DOI10.1007/s001860000061zbMath1103.91313OpenAlexW2094691341MaRDI QIDQ1397689
Vito Fragnelli, Luciano Méndez-Naya, Ignacio Garcia-Jurado
Publication date: 7 August 2003
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860000061
Related Items
The Shapley value for shortest path games: a non-graph-based approach ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ Stable and weakly additive cost sharing in shortest path problems ⋮ Horizontal cooperation in a multimodal public transport system: the profit allocation problem ⋮ Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ The minimum cost shortest-path tree game ⋮ Modeling cooperation on a class of distribution problems