General Cops and Robbers Games with randomness

04/24/2020
by   Frédéric Simard, et al.
0

Cops and Robbers games have been studied for the last few decades in computer science and mathematics. As in general pursuit evasion games, pursuers (cops) seek to capture evaders (robbers); however, players move in turn and are constrained to move on a discrete structure, usually a graph, and know the exact location of their opponent. In 2017, Bonato and MacGillivray presented a general characterization of Cops and Robbers games in order for them to be globally studied. However, their model doesn't cover cases where stochastic events may occur, such as the robbers moving in a random fashion. In this paper we present a novel model with stochastic elements that we call a Generalized Probabilistic Cops and Robbers game (GPCR). A typical such game is one where the robber moves according to a probabilistic distribution, either because she is rather lost or drunk than evading, or because she is a robot. We present results to solve GPCR games, thus enabling one to study properties relating to the optimal strategies in large classes of Cops and Robbers games. Some classic Cops and Robbers games properties are also extended.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2019

Bidding Mechanisms in Graph Games

In two-player games on graphs, the players move a token through a graph ...
research
05/16/2023

On Optimal Strategies for Wordle and General Guessing Games

The recent popularity of Wordle has revived interest in guessing games. ...
research
10/06/2022

Computing Threshold Budgets in Discrete-Bidding Games

In a two-player zero-sum graph game, the players move a token throughout...
research
01/18/2019

Game-Theoretic Randomness for Blockchain Games

In this paper, we consider the problem of generating fair randomness in ...
research
07/22/2020

Differential games, locality and model checking for FO logic of graphs

We introduce differential games for FO logic of graphs, a variant of Ehr...
research
07/22/2019

Codensity Games for Bisimilarity

Bisimilarity as an equivalence notion of systems has been central to pro...
research
07/03/2019

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata

The probabilistic bisimilarity distance of Deng et al. has been proposed...

Please sign up or login with your details

Forgot password? Click here to reset