The program constructions in abstract retention problem

DOI10.1007/978-3-030-42831-0_7MaRDI QIDQ5129790zbMATH OpenOpenAlexFDO

Authors

Publication date 23 October 2020

Published in Lecture Notes in Control and Information Sciences - Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-42831-0_7

zbMATH Keywords

admissible control proceduresdifferential games theorygame retention problemset-valued quasistrategies

Mathematics Subject Classification ID

Differential games (aspects of game theory) (91A23)

Recommendations

• Programmed iteration method and operator convexity in an abstract retention problem
• On a representation of the solvability set in the retention problem
• Implementation of the programmed iterations method in packages of spaces
• On a dynamic game problem with an indecomposable set of disturbances
• The elements of the operator convexity in the construction of the programmed iteration method

Cites work

• An abstract confinement problem: A programmed iterations method of solution
• An alternative for the game problem of convergence
• Axiomatic approach in differential games
• Construction of a stable bridge for a class of linear games
• scientific article; zbMATH DE number 192835 (Why is no real title available?)
• scientific article; zbMATH DE number 3614551 (Why is no real title available?)
• scientific article; zbMATH DE number 1762858 (Why is no real title available?)
• scientific article; zbMATH DE number 3204219 (Why is no real title available?)
• Implementation of the programmed iterations method in packages of spaces
• On interrelations between different versions of the method of program iterations: a positional version
• On solving pursuit game problems
• On the duality of different versions of the method of programmed iterations
• ON THE GAME PROBLEM OF CONVERGENCE AT A GIVEN MOMENT OF TIME
• Programmed iteration method in packages of spaces
• Transfinite sequences in the programmed iteration method
• Values in differential games

Cited in

(5)

• The elements of the operator convexity in the construction of the programmed iteration method
• Programmed iteration method and operator convexity in an abstract retention problem
• On the control of discrete systems in an infinite time interval
• On a representation of the solvability set in the retention problem
• On a dynamic game problem with an indecomposable set of disturbances

This page was built for publication: The program constructions in abstract retention problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129790)