Abstract:
We consider network models of a problem of discrete optimal control
with fixed ends formulated as a game with $p$ players.
We investigate the problem of existence of optimal strategies of the players in
the sense of Nash in the network dynamic model of the game with $p$ players
and obtain results which allow us to construct polynomial algorithms for solving
the problem.