Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models