Generalized cops and robbers: a multi-player pursuit game on graphs

From MaRDI portal
Publication:2292118

DOI10.1007/S13235-018-0288-0zbMATH Open1431.91045arXiv1807.08500OpenAlexW2883617225MaRDI QIDQ2292118FDOQ2292118


Authors: Yanyan Li Edit this on Wikidata


Publication date: 3 February 2020

Published in: Dynamic Games and Applications (Search for Journal in Brave)

Abstract: We introduce and study the Generalized Cops and Robbers game (GCR), 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 non-positional ones. We also study the capturing properties of GCR Nash Equilibria in connection to 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.


Full work available at URL: https://arxiv.org/abs/1807.08500




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Generalized cops and robbers: a multi-player pursuit game on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292118)