Premium
The discrete evasion game with three‐move lag
Author(s) -
Lee L. Y.,
Lee K. T.
Publication year - 1990
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199012)37:6<867::aid-nav3220370606>3.0.co;2-m
Subject(s) - lag , upper and lower bounds , evasion (ethics) , mathematical economics , value (mathematics) , time lag , repeated game , mathematics , discrete time and continuous time , sequential game , computer science , economics , game theory , statistics , mathematical analysis , computer network , immune system , immunology , biology
The discrete evasion game with three‐move lag, formulated over 30 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. In this article we obtain an upper bound for the value by constructing a strategy which consists of 400 conditional probabilities for the minimizing player. This is believed to be the best upper bound known.