Geodesic
Quasistrategies in an abstract control problem and the method of programmed iterations (a~direct version)
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 11 (2005), pp. 53-65.

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

@article{IVM_2005_11_a8,
     author = {A. G. Chentsov},
     title = {Quasistrategies in an abstract control problem and the method of programmed iterations (a~direct version)},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {53--65},
     publisher = {mathdoc},
     number = {11},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2005_11_a8/}
}
TY  - JOUR
AU  - A. G. Chentsov
TI  - Quasistrategies in an abstract control problem and the method of programmed iterations (a~direct version)
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2005
SP  - 53
EP  - 65
IS  - 11
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2005_11_a8/
LA  - ru
ID  - IVM_2005_11_a8
ER  - 
%0 Journal Article
%A A. G. Chentsov
%T Quasistrategies in an abstract control problem and the method of programmed iterations (a~direct version)
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2005
%P 53-65
%N 11
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2005_11_a8/
%G ru
%F IVM_2005_11_a8
A. G. Chentsov. Quasistrategies in an abstract control problem and the method of programmed iterations (a~direct version). Izvestiâ vysših učebnyh zavedenij. Matematika, no. 11 (2005), pp. 53-65. http://geodesic.mathdoc.fr/item/IVM_2005_11_a8/

[1] Aizeks R., Differentsialnye igry, Mir, M., 1967, 479 pp. | MR

[2] Krasovskii N.N., Igrovye zadachi o vstreche dvizhenii, Nauka, M., 1970, 420 pp. | MR

[3] Krasovskii N.N., Subbotin A.I., Pozitsionnye differentsialnye igry, Nauka, M., 1974, 456 pp. | MR

[4] Krasovskii N.N., Upravlenie dinamicheskoi sistemoi. Zadacha o minimume garantirovannogo rezultata, Nauka, M., 1985, 518 pp. | MR

[5] Subbotin A.I., Minimaksnye neravenstva i uravneniya Gamiltona–Yakobi, Nauka, M., 1991, 215 pp. | MR

[6] Subbotin A.I., Chentsov A.G., Optimizatsiya garantii v zadachakh upravleniya, Nauka, M., 1981, 287 pp. | MR

[7] Pontryagin L.S., “K teorii differentsialnykh igr”, UMN, 21:4 (1966), 219–274 | MR | Zbl

[8] Pontryagin L.S., Mischenko E.F., “Zadacha ob ubeganii odnogo upravlyaemogo ob'ekta ot drugogo”, DAN SSSR, 189:4 (1969), 721–723 | Zbl

[9] Pshenichnyi B.N., “Struktura differentsialnykh igr”, DAN SSSR, 184:2 (1969), 285–287

[10] Kurzhanskii A.B., Upravlenie i nablyudenie v usloviyakh neopredelennosti, Nauka, M., 1977, 390 pp. | MR | Zbl

[11] Osipov Yu.S., “An informative game problem”, Optimization Techniques IFIP Technical Conference, 27 (1975), 482–486 | Zbl

[12] Kryazhimskii A.V., “Alternativa v lineinoi igre sblizheniya-ukloneniya s nepolnoi informatsiei”, DAN SSSR, 230:4 (1976), 773–776 | MR | Zbl

[13] Kurzhanskii A.B., “Optimalnye sistemy sochetaniya upravleniya i nablyudeniya”, PMM, 38:1 (1974), 12–24 | MR | Zbl

[14] Chentsov A.G., “O strukture odnoi igrovoi zadachi sblizheniya”, DAN SSSR, 224:6 (1975), 1272–1275 | MR | Zbl

[15] Chentsov A.G., “Ob igrovoi zadache sblizheniya v zadannyi moment vremeni”, Matem. sb., 99:3 (1976), 394–420 | MR | Zbl

[16] Chentsov A.G., “K igrovoi zadache navedeniya”, DAN SSSR, 226:1 (1976), 73–76 | MR | Zbl

[17] Chentsov A.G., “K igrovoi zadache navedeniya s informatsionnoi pamyatyu”, DAN SSSR, 227:2 (1976), 306–308 | MR | Zbl

[18] Chistyakov S.V., “K resheniyu igrovykh zadach presledovaniya”, PMM, 41:5 (1977), 825–832 | MR | Zbl

[19] Chentsov A.G., Metod programmnykh iteratsii dlya differentsialnoi igry sblizheniya-ukloneniya, Dep. v VINITI 04.06.79, No 1933-79, In-t matem. i mekhan. Uralsk. nauch. tsentra AN SSSR, Sverdlovsk, 1979, 102 pp.

[20] Edvards R., Funktsionalnyi analiz. Teoriya i prilozheniya, Mir, M., 1969, 1071 pp.

[21] Serov V.P., “Iteratsionnye konstruktsii v odnoi informatsionnoi igrovoi zadache”, Tez. dokl. III Vsesoyuzn. shkoly “Pontryaginskie chteniya. Optimalnoe upravlenie, geometriya i analiz”, Kemerovsk. un-t, 1990, 198

[22] Chentsov A.G., “K voprosu ob iteratsionnoi realizatsii neuprezhdayuschikh mnogoznachnykh otobrazhenii”, Izv. vuzov. Matematika, 2000, no. 3, 66–76 | MR | Zbl

[23] Chentsov A.G., “Non-anticipating selectors of set-valued mapping and iterated procedures”, Functional Differential Equations, 1999, no. 3–4, 249–274 | MR | Zbl

[24] Chentsov A.G., “Neuprezhdayuschie mnogoznachnye otobrazheniya i ikh postroenie s pomoschyu metoda programmnykh iteratsii, I”, Differents. uravneniya, 37:4 (2001), 470–480 | MR | Zbl

[25] Chentsov A.G., “Neuprezhdayuschie mnogoznachnye otobrazheniya i ikh postroenie s pomoschyu metoda programmnykh iteratsii, II”, Differents. uravneniya, 37:5 (2001), 679–688 | MR | Zbl

[26] Roxin E., “Axiomatic approach in differential games”, J. Optimiz. Theory and Appl., 3:3 (1969), 153–163 | DOI | MR | Zbl

[27] Elliott R.J., Kalton N.J., The existence of value in differential games, Memoirs of the Amer. Math. Soc., 126, 1972, 67 pp. | MR | Zbl

[28] Varaiy P., Lin J., “Existence of saddle points in differential games”, SIAM J. Control., 7 (1969), 141–157 | DOI | Zbl

[29] Chentsov A.G., Morina S.I., Extensions and relaxations, Kluwer Academic Publishers, Dordrecht–Boston–London, 2002, 408 pp. | MR | Zbl

[30] Neve Zh., Matematicheskie osnovy teorii veroyatnostei, Mir, M., 1969, 309 pp. | MR | Zbl

[31] Kelli Dzh.L., Obschaya topologiya, Nauka, M., 1981, 431 pp.

[32] Engelking R., Obschaya topologiya, Mir, M., 1986, 751 pp. | MR

[33] Varga Dzh., Optimalnoe upravlenie differentsialnymi i funktsionalnymi uravneniyami, Nauka, M., 1977, 624 pp. | MR

[34] Gamkrelidze R.V., Osnovy optimalnogo upravleniya, Izd-vo Tbilissk. un-ta, Tbilisi, 1975, 229 pp. | MR