Abstract
The discrete evasion game with a three-move lag, formulated over thirty years ago, was one of the earliest games with time-lag complications. This game remains unsolved, even though it is well-known that the game has a value. By considering the bomber-battleship duel and by constructing an explicit strategy for the bomber, we bound the value from below as 0.28648. This is believed to be the best lower bound known.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baston, V. J., andBostock, F. A.,An Evasion Game on a Finite Tree, SIAM Journal on Control and Optimization, Vol. 23, pp. 671–677, 1990.
Bernhard, P., Colomb, A. L., andPapavassilopoulos, G. P.,Rabbit and Hunter Game: Two Discrete Stochastic Formulations, Computers and Mathematics with Applications, Vol. 13, pp. 205–225, 1987.
Basar, T.,On a Class of Zero-Sum Games with Delayed Information, Differential Games and Application, Edited by T. Basar and P. Bernhard, Springer-Verlag, Berlin, Germany, Vol. 119, pp. 9–34, 1989.
Bram, J.,The Discrete Evasion Game, Research Contribution 244, Center for Naval Analysis, 1973.
Lee, L. Y., andLee, K. T.,The Discrete Evasion Game with Three-Move Lag, Naval Research Logistics, Vol. 37, pp. 867–874, 1990.
Matula, D. W.,Games of Sequence Prediction, Report ORC 66-3, Operations Research Center, University of California, Berkeley, California, 1966.
Burrow, J. L.,A Multistage Game with Incomplete Information Requiring an Infinite Memory, Journal of Optimization Theory and Applications, Vol. 24, pp. 337–360, 1978.
Ferguson, T. S.,On Discrete Evasion Games with a Two-Move Information Lag, Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, California, Vol. 1, pp. 453–462, 1967.
Isaacs, R.,Differential Games, John Wiley and Sons, New York, New York, 1967.
Author information
Authors and Affiliations
Additional information
Communicated by P. L. Yu
Rights and permissions
About this article
Cite this article
Lee, K.T., Lee, L.Y. On a discrete evasion game of Isaacs. J Optim Theory Appl 74, 259–271 (1992). https://doi.org/10.1007/BF00940894
Issue Date:
DOI: https://doi.org/10.1007/BF00940894