The discrete evasion game with three‐move lag

L. Y. Lee and K. T. Lee

Naval Research Logistics (NRL), 1990, vol. 37, issue 6, 867-874

Abstract: 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.

Date: 1990
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199012)37:63.0.CO;2-M

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:37:y:1990:i:6:p:867-874

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().