Skip to main content
SpringerLink
Log in

On the infiltration game

  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Abstract

An infiltrator tries to go through a graph ofn arcs, within a time limit, without being caught by a guard. The latter is allowed a restricted number of tentatives to catch the infiltrator. This paper describes optimal strategies and gives the value of this discrete zero-sum infiltration game.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alpern S (1992) Infiltration games on arbitrary graphs. Journal of Mathematical Analysis and Applications 163: 286–288

    Google Scholar 

  • Auger JM (1991a) An infiltration game onk arcs. Naval Research Logistics 38: 511–529

    Google Scholar 

  • Auger JM (1991b) On discrete games of infiltration. In: Hamalainen RP, Ehtamo HK (eds) Differential Games—Developments in Modeling and Computation. Springer-Verlag, Berlin 144–150

    Google Scholar 

  • Baston VJ, Bostock FA (1991) A generalized inspection game. Naval Research Logistics 38:171–182

    Google Scholar 

  • Gal S (1980) Search games. Academic Press, New York

    Google Scholar 

  • Garnaev AY (1994) A remark on the customs and smuggler game. Naval Research Logistics 41: 287–293

    Google Scholar 

  • Lalley SP (1988) A one-dimensional infiltration game. Naval Research Logistics 35: 441–446

    Google Scholar 

  • Sakaguchi M (1994) A sequential game on multi-opportunity infiltration. Mathematica Japonica 39: 157–166

    Google Scholar 

  • Thomas MU, Nisgav V (1976) An infiltration game with time dependent payoff. Naval Research Logistics Quarterly 23: 297–302

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computational Mathematics, Saint Petersburg State University of Architecture and Civil Engineering, 2-ya Krasnoarmejskaya 4, 198005, Saint Petersburg, Russia

    A. Garnaev

  2. Institute of Physics, 0N0I, Saint Petersburg State University, Star.Petergoff, Uljanovskaya 1, 198904, Saint Petersburg, Russia

    G. Garnaeva

  3. Institut de Protection et de Sureté Nucléaire, B.P. 6, 92265, Fontenay-aux-Roses Cedex, France

    P. Goutal

Authors
  1. A. Garnaev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Garnaeva
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Goutal
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The authors are very grateful to Professor S. Sorin for his valuable comments on the subject.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Garnaev, A., Garnaeva, G. & Goutal, P. On the infiltration game. Int J Game Theory 26, 215–221 (1997). https://doi.org/10.1007/BF01295850

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01295850

Key words

Search

Navigation