Patrolling a Border

Published Online:https://doi.org/10.1287/opre.2016.1511

References

  • Alpern S (2013) Network search from a game theoretic perspective. Topaloglu H, ed. Tutorials in Operations Research: Theory Driven by Influential Applications (INFORMS, Catonsville, MD), 60–70.Google Scholar
  • Alpern S, Morton A, Papadaki K (2011) Patrolling games. Oper. Res. 59(5):1246–1257.LinkGoogle Scholar
  • Basilico N, Gatti N, Amigoni F (2012) Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder. Artif. Intell. 184:78–123.CrossrefGoogle Scholar
  • Basilico N, Giuseppe DN, Gatti N (2015) Adversarial patrolling with spatially uncertain alarm signals. arXiv:1506.02850 [cs.AI].Google Scholar
  • Baston V, Kikuta K (2004) An ambush game with an unknown number of infiltrators. Oper. Res. 52(4):597–605.LinkGoogle Scholar
  • Baston V, Kikuta K (2009) Technical note—an ambush game with a fat infiltrator. Oper. Res. 57(2):514–519.LinkGoogle Scholar
  • Baston VJ, Bostock FA (1987) A continuous game of ambush. Nav. Res. Log. 34(5):645–654.CrossrefGoogle Scholar
  • Baykal-Gürsoy M, Duan Z, Poor HV, Garnaev A (2014) Infrastructure security games. Eur. J. Oper. Res. 239(2):469–478.CrossrefGoogle Scholar
  • Chung H, Polak E, Royset JO, Sastry SS (2011) Optimal periodic patrolling trajectories of UUVs guarding a channel. Proc. Amer. Control Conf. ACC, ’11 (IEEE, Piscataway, NJ), 888–893.CrossrefGoogle Scholar
  • Collins A, Czyzowicz J, Gasieniec L, Kosowski A, Kranakis E, Krizanc D, Morales Ponce O (2013, July) Optimal patrolling of fragmented boundaries. Proc. Twenty-Fifth Ann. ACM Sympos. Parallelism in Algorithms and Architectures (ACM, New York), 241–250.CrossrefGoogle Scholar
  • Fokkink R, Lindelauf R (2013) The application of search games to counter terrorism studies. Handbook of Computational Approaches to Counterterrorism (Springer, New York), 543–557.CrossrefGoogle Scholar
  • Gal S (1979) Search games with mobile and immobile hider. SIAM J. Control Optim. 17(1):99–122.CrossrefGoogle Scholar
  • Gal S (2000) On the optimality of a simple strategy for searching graphs. Internat. J. Game Theory 6(29):533–542.Google Scholar
  • Hochbaum DS, Lyu C, Ordóñez F (2014) Security routing games with multivehicle Chinese postman problem. Networks 64(3):181–191.CrossrefGoogle Scholar
  • Lin KY, Atkinson MP, Glazebrook KD (2014) Optimal patrol to uncover threats in time when detection is imperfect. Naval Res. Logist. 61(8):557–576.CrossrefGoogle Scholar
  • Lin KY, Atkinson MP, Chung TH, Glazebrook KD (2013) A graph patrol problem with random attack times. Oper. Res. 61(3):694–710.LinkGoogle Scholar
  • Morse PM, Kimball GE (1951) Methods of Operations Research (MIT Press and Wiley, Cambridge, MA; New York).Google Scholar
  • Pita J, Jain M, Marecki J, Ordóñez F, Portway C, Tambe M, Western C, Paruchuri P, Kraus S. (2008) Deployed ARMOR protection: The application of a game theoretic model for security at the Los Angeles international airport. Proc. 7th Internat. Joint Conf. Autonomous Agents Multiagent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Southland, SC), 125–132.Google Scholar
  • Szechtman R, Kress M, Lin K, Cfir D (2008) Models of sensor operations for border surveillance. Nav. Res. Log. 55(1):27–41.CrossrefGoogle Scholar
  • Washburn A (2010) Barrier games. Mil. Oper. Res. 15(3):31–41.CrossrefGoogle Scholar
  • Washburn AR (1982) On patrolling a channel. Nav. Rese. Logist. Q. 29(4):609–615.CrossrefGoogle Scholar
  • Zoroa N, Fernández-Sáez MJ, Zoroa P (2012) Patrolling a perimeter. Eur. J. Oper. Res. 222(3):571–582.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.