Discretization of the continuous ambush game

I.D. Woodward

Naval Research Logistics (NRL), 2003, vol. 50, issue 5, 515-529

Abstract: This article further considers the two‐person continuous ambush game introduced by Ruckle. This article extends the work of Ruckle, Baston and Bostock, and Lee by considering the game for a general number of barriers. By supplanting optimal strategies from a discretized version of the game, we show that there always exists a value for the game, which, furthermore, can be found using linear programming techniques. Further to this, we show that the discrete ambush game considered by Garnaev has the same value as a continuous game, allowing many new results to be obtained in both games. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 515–529, 2003

Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.10066

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:50:y:2003:i:5:p:515-529

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 ().