Steven A. Gabriel, David Bernstein. Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models. Computational & Mathematical Organization Theory, 6(1):29-45, 2000. [doi]
@article{GabrielB00,
title = {Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models},
author = {Steven A. Gabriel and David Bernstein},
year = {2000},
doi = {10.1023/A:1009621108971},
url = {http://dx.doi.org/10.1023/A:1009621108971},
researchr = {https://researchr.org/publication/GabrielB00},
cites = {0},
citedby = {0},
journal = {Computational & Mathematical Organization Theory},
volume = {6},
number = {1},
pages = {29-45},
}