| Article ID: | iaor20013524 |
| Country: | Germany |
| Volume: | 52 |
| Issue: | 2 |
| Start Page Number: | 251 |
| End Page Number: | 264 |
| Publication Date: | Jan 2000 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Garca-Jurado I., Mndez-Naya L., Fragnelli V. |
| Keywords: | networks: path |
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.