A Graph Patrol Problem with Random Attack Times

References

• Alpern S, Gal S. Searching for an agent who may or may not want to be found. Oper. Res. (2002) 50(2):311–323Link, Google Scholar
• Alpern S, Gal S. The Theory of Search Games and Rendezvous (2003) (Kluwer Academic Publishers, Norwell, MA) Google Scholar
• Alpern S, Morton A, Papadaki K. Patrolling games. Oper. Res. (2011) 59(5):1246–1257Link, Google Scholar
• Archibald TW, Black DP, Glazebrook KD. Indexability and index heuristics for a simple class of inventory routing problems. Oper. Res. (2009) 57(2):314–326Link, Google Scholar
• Auger JM. An infiltration game on k arcs. Naval Res. Logist. (1991) 38(4):511–529Crossref, Google Scholar
• Baston V, Kikuta K. An ambush game with an unknown number of infiltrators. Oper. Res. (2004) 52(4):597–605Link, Google Scholar
• Baston V, Kikuta K. An ambush game with a fat infiltrator. Oper. Res. (2009) 57(2):514–519Link, Google Scholar
• Birge J, Pollock S. Modelling rural police patrol. J. Oper. Res. Soc. (1989) 40(1):41–54Crossref, Google Scholar
• Chaiken J, Dormont P. A patrol car allocation model: Capabilities and algorithms. Management Sci. (1978) 24(12):1291–1300Link, Google Scholar
• Chelst K. An algorithm for deploying a crime directed (tactical) patrol force. Management Sci. (1978) 24(12):1314–1327Link, Google Scholar
• Dunnigan JF. The Complete Wargames Handbook: How to Play, Design and Find Them (1992) (Quill, Minneapolis) Google Scholar
• Gittins JC, Glazebrook KD, Weber R. Multi-armed Bandit Allocation Indices (2011) 2nd ed.(John Wiley & Sons, Hoboken, NJ) Crossref, Google Scholar
• Glazebrook KD, Kirkbride C, Ouenniche J. Index policies for the admission control and routing of impatient customers to heterogeneous service stations. Oper. Res. (2009) 57(4):975–989Link, Google Scholar
• Glazebrook KD, Kirkbride C, Mitchell HM, Gaver DP, Jacobs PA. Index policies for shooting problems. Oper. Res. (2007) 55(4):769–781Link, Google Scholar
• Karp RM, Miller RE, Thatcher JW. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum, New York) 85–103Crossref, Google Scholar
• Larson RC. Urban Police Patrol Analysis (1972) (MIT Press, Cambridge, MA) Google Scholar
• Lee S, Franz L, Wynne A. Optimizing state patrol manpower allocation. J. Oper. Res. Soc. (1979) 30(10):885–896Crossref, Google Scholar
• Olson D, Wright G. Models for allocating police preventive patrol effort. Oper. Res. Quart. (1975) 26(4, Part 1):703–715Crossref, Google Scholar
• Puterman ML. Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994) (John Wiley & Sons, New York) Crossref, Google Scholar
• Robinson J. An iterative method of solving a game. Ann. Math. (1951) 54(2):296–301Crossref, Google Scholar
• Ross SM. Introduction to Probability Models (2010) 10th ed.(Academic Press, San Diego) Google Scholar
• Ruckle W. Geometric Games and Their Applications (1983) (Pitman Advanced Publishing Program, Boston) Google Scholar
• Shieh E, An B, Yang R, Tambe M, Baldwin C, DiRenzo J, Maule B, Meyer G. Protect: A deployed game theoretic system to protect the ports of the United States. Internat. Conf. Autonomous Agents and Multiagent Systems (AAMAS) (2012) (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC) Google Scholar
• Taylor B, Moore L, Clayton E, Davis K, Rakes T. An integer nonlinear goal programming model for the deployment of state highway patrol units. Management Sci. (1985) 31(11):1335–1347Link, Google Scholar
• Thomas L, Washburn A. Dynamic search games. Oper. Res. (1991) 39(3):415–422Link, Google Scholar
• Washburn A, Wood K. Two-person zero-sum games for network interdiction. Oper. Res. (1995) 43(2):243–251Link, Google Scholar
• Washburn AR. Two-Person Zero-Sum Games (2003) 3rd ed.(INFORMS, Hanover, MD) Google Scholar
• Weber R, Weiss G. On an index policy for restless bandits. J. Appl. Probab. (1990) 27(3):637–648Crossref, Google Scholar
• Weber R, Weiss G. Addendum to “On an index policy for restless bandits”. Adv. Appl. Probab. (1991) 23(2):429–430Crossref, Google Scholar
• Whittle P. Restless bandits: Activity allocation in a changing world. J. Appl. Probab. (1988) 25:287–298Crossref, Google Scholar
• Zoroa N, Zoroa P, Fernandez-Saez MJ. Weighted search games. Eur. J. Oper. Res. (2009) 195(2):394–411Crossref, Google Scholar