The problem of finding the optimal paths in network games with p players, which generalizes the well-known combinatorial problem on the shortest path in a network and which arose as an auxiliary one when studying cyclic games, is studied. Polynomial-time algorithms for finding the optimal paths as well as the optimal by Nash strategies of the players in network games are proposed.
