Geodesic
Network models of discrete optimal control, and dynamic games with $p$ players
Diskretnaya Matematika, Tome 13 (2001) no. 4, pp. 126-143.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DM_2001_13_4_a9,
     author = {D. D. Lozovanu},
     title = {Network models of discrete optimal control, and dynamic games with $p$ players},
     journal = {Diskretnaya Matematika},
     pages = {126--143},
     publisher = {mathdoc},
     volume = {13},
     number = {4},
     year = {2001},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2001_13_4_a9/}
}
TY  - JOUR
AU  - D. D. Lozovanu
TI  - Network models of discrete optimal control, and dynamic games with $p$ players
JO  - Diskretnaya Matematika
PY  - 2001
SP  - 126
EP  - 143
VL  - 13
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2001_13_4_a9/
LA  - ru
ID  - DM_2001_13_4_a9
ER  - 
%0 Journal Article
%A D. D. Lozovanu
%T Network models of discrete optimal control, and dynamic games with $p$ players
%J Diskretnaya Matematika
%D 2001
%P 126-143
%V 13
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2001_13_4_a9/
%G ru
%F DM_2001_13_4_a9
D. D. Lozovanu. Network models of discrete optimal control, and dynamic games with $p$ players. Diskretnaya Matematika, Tome 13 (2001) no. 4, pp. 126-143. http://geodesic.mathdoc.fr/item/DM_2001_13_4_a9/

[1] Romanovskii I. V., “Optimizatsiya statsionarnogo upravleniya diskretnym determinirovannym protsessom”, Kibernetika, 1967, no. 2, 66–78 | MR | Zbl

[2] Bellman R., Kalaba R., Dinamicheskoe programmirovanie i sovremennaya teoriya upravleniya, IL, Moskva, 1966

[3] Gurvich V. A., Karzanov A. V., Khachiyan L. G., “Tsiklicheskie igry i nakhozhdenie minimaksnykh srednikh tsiklov v orientirovannykh grafakh”, Zhurnal vychisl. matem. i matem. fiziki, 28 No9 (1988), 1407–1417 | MR

[4] Kristofides N., Teoriya grafov: algoritmicheskii podkhod, Mir, Moskva, 1978 | MR

[5] Lozovanu D. D., “Algoritmy resheniya nekotorykh klassov setevykh minimaksnykh zadach i ikh prilozheniya”, Kibernetika, 1991, no. 1, 70–75 | MR | Zbl

[6] Lozovanu D. D., Trubin V. A., “Zadacha o minimaksnom puti v seti i algoritm ee resheniya”, Diskretnaya matematika, 6:2 (1994), 138–144 | MR | Zbl

[7] Lozovanu D. D., “Silnopolinomialnye algoritmy poiska minimaksnykh putei v setyakh i reshenie tsiklicheskikh igr”, Kibernetika i sistemnyi analiz, 1993, no. 5, 145–151 | MR | Zbl

[8] Nash J. F., “Non cooperative games”, Ann. Math., 2 (1951), 286–295 | DOI | MR | Zbl

[9] Mulen E., Teoriya igr s primerami iz matematicheskoi ekonomiki, Mir, Moskva, 1985 | MR | Zbl

[10] Lozovanu D., “Dynamic games with $p$ players on networks”, Izv. AN Respubliki Moldova, Matematika, 32:1 (2000), 41–54 | MR

[11] Boliac R., Lozovanu D., Solomon D., “Optimal paths in network games with $p$ players”, Discrete Appl. Math., 99:1–3 (2000), 339–348 | DOI | MR | Zbl