Abstract
We obtain a lower bound for the pursuing (searching) point velocity for which the minimax dynamic graph search problem in N.N. Petrov’s setting is solvable.
This is a preview of subscription content, log in via an institution to check access.
References
Parsons, T.D., in Theory and Applications of Graphs, Alavi, Y. and Lick, D.R., Eds., Berlin: Springer, 1976, pp. 426–441.
Sugihara, K. and Suzuki, I., SIAM J. Discrete Methods, 1989, vol. 2, pp. 126–143.
Chernous’ko, F.L., Prikl. Mat. Mekh., 1980, vol. 44, no. 1, pp. 3–12.
Andrianov, V.Y. and Petrov, N.N., Game Theory and Applications, 2005, vol. 10, pp. 1–12.
Kim, D.P., Metody poiska i presledovaniya podvizhnykh ob”ektov (Methods for Search and Pursuit of Moving Objects), Moscow: Nauka, 1989.
Gal, S., Search Games, New York, 1980.
Petrov, N.N., Differ. Uravn., 1982, vol. 18, no. 5, pp. 821–827.
Golovach, P.A. and Petrov, N.N., Vestn. Leningr. Univ. Ser. 1, 1986, vol. 4, pp. 15–19.
Golovach, P.A., Vestn. Leningr. Univ. Ser. 1, 1990, vol. 3, pp. 16–21.
Azamov, A. and Nordzhigitov, Kh., Uzbek. Mat. Zh., 1991, no. 4, pp. 13–18.
Golovach, P.A., Petrov, N.N., and Fomin, F.V., Tr. Inst. Mat. Mekh. Uralsk. Otdel. RAN, 2000, vol. 6, no. 1, pp. 39–54.
Kapilevich, V.O. and Petrov, N.N., Vestnik St. Peterburg Univ. Ser. 1, 2003, vol. 3, pp. 31–37.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.A. Azamov, 2008, published in Differentsial’nye Uravneniya, 2008, Vol. 44, No. 12, pp. 1700–1703.
Rights and permissions
About this article
Cite this article
Azamov, A.A. Lower bound for the advantage coefficient in the search problem on graphs. Diff Equat 44, 1764–1767 (2008). https://doi.org/10.1134/S0012266108120136
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0012266108120136