Transfinite sequences in the programmed iteration method

DOI10.1134/S0081543818020153zbMath1395.49035MaRDI QIDQ721523

Dmitriy Serkov

Publication date: 19 July 2018

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

fixed pointschain-complete posetsprogrammed iteration methodquasistrategiestransfinite iterations

Mathematics Subject Classification ID

Differential games and control (49N70) Pursuit and evasion games (49N75)

Related Items (3)

Transfinite version of the program iteration method in a game problem of approach for an abstract dynamical system ⋮ ON A DYNAMIC GAME PROBLEM WITH AN INDECOMPOSABLE SET OF DISTURBANCES ⋮ The Program Constructions in Abstract Retention Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On solving pursuit game problems
• On the construction of a stable bridge in a retention game
• Construction of a stable bridge for a class of linear games
• Constructive versions of Tarski's fixed point theorems
• An abstract confinement problem: A programmed iterations method of solution
• A short and constructive proof of Tarski's fixed-point theorem
• An alternative for the game problem of convergence
• Sur le théorème de Zorn
• Programmed iteration method and operator convexity in an abstract retention problem
• Monotone iterations of sets and their applications to control games

This page was built for publication: Transfinite sequences in the programmed iteration method