Geodesic
Unlocking of predicate: application to constructing a non-anticipating selection
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 27 (2017) no. 2, pp. 283-291 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We consider an approach to constructing a non-anticipating selection of a multivalued mapping; such a problem arises in control theory under conditions of uncertainty. The approach is called “unlocking of predicate” and consists in the reduction of finding the truth set of a predicate to searching fixed points of some mappings. Unlocking of predicate gives an extra opportunity to analyze the truth set and to build its elements with desired properties. In this article, we outline how to build “unlocking mappings” for some general types of predicates: we give a formal definition of the predicate unlocking operation, the rules for the construction and calculation of “unlocking mappings” and their basic properties. As an illustration, we routinely construct two unlocking mappings for the predicate “be non-anticipating mapping” and then on this base we provide the expression for the greatest non-anticipating selection of a given multifunction.
Keywords: predicate unlocking, fixed points, nonanticipating mappings. 
@article{VUU_2017_27_2_a10,
     author = {D. A. Serkov},
     title = {Unlocking of predicate: application to constructing a non-anticipating selection},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {283--291},
     year = {2017},
     volume = {27},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/VUU_2017_27_2_a10/}
}
TY  - JOUR
AU  - D. A. Serkov
TI  - Unlocking of predicate: application to constructing a non-anticipating selection
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2017
SP  - 283
EP  - 291
VL  - 27
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/VUU_2017_27_2_a10/
LA  - en
ID  - VUU_2017_27_2_a10
ER  - 
%0 Journal Article
%A D. A. Serkov
%T Unlocking of predicate: application to constructing a non-anticipating selection
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2017
%P 283-291
%V 27
%N 2
%U http://geodesic.mathdoc.fr/item/VUU_2017_27_2_a10/
%G en
%F VUU_2017_27_2_a10
D. A. Serkov. Unlocking of predicate: application to constructing a non-anticipating selection. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 27 (2017) no. 2, pp. 283-291. http://geodesic.mathdoc.fr/item/VUU_2017_27_2_a10/

[1] Kakutani S., “A generalization of Brouwer's fixed point theorem”, Duke Math. J., 8:3 (1941), 457–459 | DOI | MR

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

[3] Nikaido H., “On von Neumann's minimax theorem”, Pacific Journal of Mathematics, 4:1 (1954), 65–72 | DOI | MR | Zbl

[4] Chentsov A. G., “On the structure of a game problem of convergence”, Sov. Math., Dokl., 16:5 (1975), 1404–1408 | MR | Zbl

[5] Chentsov A. G., “On a game problem of guidance”, Sov. Math., Dokl., 17 (1976), 73–77 | Zbl

[6] Chentsov A. G., “Non-anticipating selectors for set-valued mappings”, Differ. Uravn. Protsessy Upr., 1998, no. 2, 29–64 (in Russian)

[7] [Ченцов А. Г., “Наследственные мультиселекторы многозначных отображений и их построение итерационными методами”, Дифференциальные уравнения и процессы управления, 1999, No 3, 1–54 ] | MR

[8] Serkov D. A., “An approach to analysis of the set of truth: unlocking of predicate”, Vestn. Udmurt. Univ. Mat. Mekh. Komp'yut. Nauki, 26:4 (2016), 525–534 (in Russian) | DOI | MR

[9] Kuratowski K., Mostowski A., Set theory, North-Holland, Amsterdam, 1967, xi+417 pp. ; Kuratovskii K., Mostovskii A., Teoriya mnozhestv, Mir, M., 1970, 416 pp. | MR | MR

[10] Markowsky G., “Chain-complete posets and directed sets with applications”, Algebra Universalis, 6:1 (1976), 53–68 | DOI | MR | Zbl

[11] Serkov D. A., “Transfinite sequences in the method of programmed iterations”, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 23, no. 1, 2017, 228–240 (in Russian) | DOI

[12] Tarski A., “A lattice-theoretical fixpoint theorem and its applications”, Pacific Journal of Mathematics, 5:2 (1955), 285–309 | DOI | MR | Zbl

[13] Cousot P., Cousot R., “Constructive versions of Tarski's fixed point theorems”, Pacific Journal of Mathematics, 82:1 (1979), 43–57 http://projecteuclid.org/euclid.pjm/1102785059 | DOI | MR | Zbl

[14] Fan K., “Minimax theorems”, Proc. Natl. Acad. Sci. USA, 39:1 (1953), 42–47 | DOI | MR

[15] Serkov D. A., “On fixed point theory and its applications to equilibrium models”, Bulletin of the South Ural State University, Series Mathematical Modelling, Programming and Computer Software, 9:1 (2016), 20–31 | DOI | Zbl