The Value of the Two Cable Ambush Game - Search Theory: A Game Theoretic Perspective - page 146

References

1. M. Aigner: Combinatorial Theory , Springer-Verlag, Berlin (1979).

2. V. J. Baston and F. A. Bostock: A Continuous Game of Ambush, Naval Research Logistics

34 645-654 (1987).

3. V. J. Baston and K. Kikuta: K. An Ambush Game with an Unknown Number of Infiltrators,

Operations Research 52 597-605 (2004).

4. V. J. Baston and K. Kikuta: An Ambush Game with a Fat Infiltrator, Operations Research 57

514-519 (2009).

5. P. J. Cameron: Combinatorics: Topics, Techniques, Algorithms , Cambridge University Press,

Cambridge (1994).

6. A. Y. Garnaev: On a Ruckle Problem in Discrete Games of Ambush, Naval Research Logistics

44 353-364 (1997).

7. A. Y. Garnaev: Search Games and Other Applications of Game Theory , Springer, London

(2000).

8. K. T. Lee: On Ruckle's Game of Ambush, Naval Research Logistics 37 355-363 (1990).

9. Marshall Hall Jr: Combinatorial Theory , Blaisdell, Waltham, MA (1967).

10. W. H. Ruckle: Geometric Games and Their Applications , Pitman, Boston, MA (1983).

11. W. H. Ruckle: Ambushing Random Walks II; Continuous Models, Operations Research 29

108-120 (1981).

12. H. Weyl: Elementary Proof of a Minimax Theorem due to Von Neumann, Contributions to the

Theory of Games, 1 19-25 (1950).

13. I. D. Woodward: Discretization of the Continuous Ambush Game, Naval Research Logistics

50 515-529 (2003).

14. I. D. Woodward: Cable Laying Ambush Games, Ph.D. thesis, University of Southampton

2002.

15. N. Zoroa, P. Zoroa and M. J. Fernández-Sáez: A Generalisation of Ruckle's Results for an

Ambush Game, European Journal of Operational Research 119 353-364 (1999).