Dynamic Games and Applications

, Volume 9, Issue 4, pp 1076–1099 | Cite as

Generalized Cops and Robbers: A Multi-player Pursuit Game on Graphs

  • Ath. KehagiasEmail author


We introduce and study the Generalized Cops and Robbers (GCR) game, an N-player pursuit game in graphs. The two-player version is essentially equivalent to the classic Cops and Robbers (CR) game. The three-player version can be understood as two CR games played simultaneously on the same graph; a player can be at the same time both pursuer and evader. The same is true for four or more players. We formulate GCR as a discounted stochastic game of perfect information and prove that, for three or more players, it has at least two Nash equilibria: one in positional deterministic strategies and another in nonpositional ones. We also study the capturing properties of GCR Nash equilibria in connection with the cop number of a graph. Finally, we briefly discuss GCR as a member of a wider family of multi-player graph pursuit games with rather interesting properties.


N-player game Pursuit Cops and robbers 


  1. 1.
    Bonato A, Nowakowski RJ (2011) The game of cops and robbers on graphs. American Mathematical Society, ProvidenceCrossRefGoogle Scholar
  2. 2.
    Bonato A, MacGillivray G (2017) Characterizations and algorithms for generalized Cops and Robbers games. arXiv preprint arXiv:1704.05655
  3. 3.
    Boros E, Gurvich V (2009) Why chess and back gammon can be solved in pure positional uniformly optimal strategies. Rutcor research report 21-2009, Rutgers UniversityGoogle Scholar
  4. 4.
    Chatterjee K, Majumdar R, Jurdziński M (2004) On Nash equilibria in stochastic games. In: Marcinkowski J, Tarlecki A (eds) International workshop on computer science logic. Springer, Berlin, pp 26–40CrossRefGoogle Scholar
  5. 5.
    Chen J et al (2016) Multi-player pursuit-evasion games with one superior evader. Automatica 71:24–32MathSciNetCrossRefGoogle Scholar
  6. 6.
    Filar J, Vrieze K (1997) Competitive Markov decision processes. Springer-Verlag, New YorkzbMATHGoogle Scholar
  7. 7.
    Fink AM (1964) Equilibrium in a stochastic \(n\)-person game. J Sci Hiroshima Univ Ser AI (Math) 28(1):89–93MathSciNetCrossRefGoogle Scholar
  8. 8.
    Foley M, Schmitendorf W (1974) A class of differential games with two pursuers versus one evader. IEEE Trans Autom Control 19(3):239–243MathSciNetCrossRefGoogle Scholar
  9. 9.
    Isaacs R (1999) Differential games: a mathematical theory with applications to warfare and pursuit, control and optimization. Courier Corporation, North ChelmsfordzbMATHGoogle Scholar
  10. 10.
    Jang JS, Tomlin C (2005) Control strategies in multi-player pursuit and evasion game. In: AIAA guidance, navigation, and control conference and exhibitGoogle Scholar
  11. 11.
    Konstantinidis G, Kehagias Ath (2017) Selfish cops and adversarial robber: multi-player pursuit evasion on graphs. arXiv preprint arXiv:1703.07695
  12. 12.
    Mulder M (1978) The structure of median graphs. Discrete Math 24(2):197–204MathSciNetCrossRefGoogle Scholar
  13. 13.
    Nowakowski R, Winkler P (1983) Vertex-to-vertex pursuit in a graph. Discrete Math 43(2–3):235–239MathSciNetCrossRefGoogle Scholar
  14. 14.
    Pham KD, Lacy S, Robertson L (2008) Multi-cumulant and Pareto strategies for stochastic multi-player pursuit-evasion. In: American control conferenceGoogle Scholar
  15. 15.
    Quilliot A (1978) Jeux et pointes fixes sur les graphes. These de 3me cycle, Universit de Paris VIGoogle Scholar
  16. 16.
    Raghavan TES, Filar JA (1991) Algorithms for stochastic games—a survey. Math Methods Oper Res 35(6):437–472MathSciNetCrossRefGoogle Scholar
  17. 17.
    Souidi M et al (2015) Coalition formation algorithm based on organization and Markov decision process for multi-player pursuit evasion. Multiagent Grid Syst 11(1):1–13MathSciNetCrossRefGoogle Scholar
  18. 18.
    Starr AW, Ho YC (1969) Nonzero-sum differential games. J Optim Theory Appl 3(3):184–206MathSciNetCrossRefGoogle Scholar
  19. 19.
    Sun W et al (2017) Multiple-pursuer/one-evader pursuit-evasion game in dynamic flowfields. J Guid Control Dyn 40:1627–1637CrossRefGoogle Scholar
  20. 20.
    Thuijsman F, Raghavan TES (1997) Perfect information stochastic games and related classes. Int J Game Theory 26(3):403–408MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Aristotle University of ThessalonikiThessalonikiGreece

Personalised recommendations