One class of simultaneous pursuit games

2012 ◽  
Vol 56 (5) ◽  
pp. 39-46 ◽  
Author(s):  
N. Yu. Satimov ◽  
G. I. Ibragimov
Keyword(s):  
2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Anthony Bonato ◽  
Jeannette Janssen

International audience We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic graphs which arise naturally from the model. We characterize the isomorphism type and induced subgraph structure of these infinite graphs using the notion of dismantlability from the theory of vertex pursuit games, and graph homomorphisms.


2019 ◽  
Vol 65 (1) ◽  
pp. 124-136
Author(s):  
M Tukhtasinov ◽  
Kh Ya Mustapokulov

In this paper, we consider two problems. In the first problem, we prove that if the assumption from the paper [1] and one additional condition on the parameters of the game hold, then the pursuit can be finished in any neighborhood of the terminal set. To complete the game, an ε-positional pursuit strategy is constructed.In the second problem, we study the invariance of a given multivalued mapping with respect to the system with distributed parameters. The system is described by the heat conductivity equation containing additive control terms on the right-hand side.


Author(s):  
Maria Prandini ◽  
Joao P. Hespanha ◽  
George J. Pappas
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document