A class of cooperative TU-games arising from shortest path problems is intr
oduced and analyzed. Some conditions under which a shortest path game is ba
lanced are obtained. Also an axiomatic characterization of the Shapley valu
e for this class of games is provided.