English
Related papers

Related papers: The Uniformed Patroller Game

200 papers

Anomaly detection is a method for discovering unusual and suspicious behavior. In many real-world scenarios, the examined events can be directly linked to the actions of an adversary, such as attacks on computer networks or frauds in…

Machine Learning · Computer Science 2020-04-23 Olga Petrova , Karel Durkota , Galina Alperovich , Karel Horak , Michal Najman , Branislav Bosansky , Viliam Lisy

We consider a variant of the target defense problem in a planar conical environment where a single defender is tasked to capture a sequence of incoming attackers. The attackers' objective is to breach the target boundary without being…

Systems and Control · Electrical Eng. & Systems 2025-09-18 Arman Pourghorban , Dipankar Maity

A new surveillance-evasion differential game is posed and solved in which an agile pursuer (the prying pedestrian) seeks to remain within a given surveillance range of a less agile evader that aims to escape. In contrast to previous…

Systems and Control · Electrical Eng. & Systems 2025-05-13 Philipp Braun , Timothy L. Molloy , Iman Shames

The optimal control of a "blind" pursuer searching for an evader moving on a road network and heading at a known speed toward a set of goal vertices is considered. To aid the "blind" pursuer, certain roads in the network have been…

Optimization and Control · Mathematics 2014-09-30 K. Krishnamoorthy , D. Casbeer , P. Chandler , M. Pachter

This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take part in a two-player game over a network of nodes whose…

Cryptography and Security · Computer Science 2010-03-15 Kien C. Nguyen , Tansu Alpcan , Tamer Basar

A gambler moves between the vertices $1, \ldots, n$ of a graph using the probability distribution $p_{1}, \ldots, p_{n}$. Multiple cops pursue the gambler on the graph, only being able to move between adjacent vertices. We investigate the…

Discrete Mathematics · Computer Science 2016-10-11 Jesse Geneson

This paper studies the problem of multi-step manipulative attacks in Stackelberg security games, in which a clever attacker attempts to orchestrate its attacks over multiple time steps to mislead the defender's learning of the attacker's…

Artificial Intelligence · Computer Science 2022-03-02 Thanh H. Nguyen , Arunesh Sinha

We consider a variation of the Cops and Robber game where the cops can only see the robber when the distance between them is at most a fixed parameter $\ell$. We consider the basic consequences of this definition for some simple graph…

Discrete Mathematics · Computer Science 2017-08-25 N. E. Clarke , D. Cox , C. Duffy , D. Dyer , S. Fitzpatrick , M. E. Messinger

Network systems often contain vulnerabilities that remain unfixed in a network for various reasons, such as the lack of a patch or knowledge to fix them. With the presence of such residual vulnerabilities, the network administrator should…

Cryptography and Security · Computer Science 2022-11-04 Narges Khakpour , David Parker

We consider a variant of the target defense problem where a single defender is tasked to capture a sequence of incoming intruders. Both the defender and the intruders have non-holonomic dynamics. The intruders' objective is to breach the…

Systems and Control · Electrical Eng. & Systems 2025-11-18 Arman Pourghorban , Dipankar Maity

We study the problem of patrolling the nodes of a network collaboratively by a team of mobile agents, such that each node of the network is visited by at least one agent once in every $I(n)$ time units, with the objective of minimizing the…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-08-14 Shantanu Das , Giuseppe Antonio Di Luna , Leszek A. Gasieniec

We propose a definition of generalized Cops and Robbers games where there are two players, the Pursuer and the Evader, who each move via prescribed rules. If the Pursuer can ensure that the game enters into a fixed set of final positions,…

Combinatorics · Mathematics 2017-04-20 Anthony Bonato , Gary MacGillivray

We propose an algorithm for constructing efficient patrolling strategies in the Internet environment, where the protected targets are nodes connected to the network and the patrollers are software agents capable of detecting/preventing…

Artificial Intelligence · Computer Science 2018-05-11 Tomáš Brázdil , Antonín Kučera , Vojtěch Řehák

Shmuel Gal and Jerome Casas have recently introduced a game theoretic model that combines search and pursuit by a predator for a prey animal. The prey (hider) can hide in a finite number of locations. The predator (searcher) can inspect any…

Computer Science and Game Theory · Computer Science 2019-12-10 Steve Alpern , Viciano Lee

This paper studies a variant of the multi-player reach-avoid game played between intruders and defenders with applications to perimeter defense. The intruder team tries to score by sending as many intruders as possible to the target area,…

Systems and Control · Electrical Eng. & Systems 2020-06-05 Daigo Shishika , James Paulos , Vijay Kumar

Aggression is a two-player game of troop placement and attack played on a map (modeled as a graph). Players take turns deploying troops on a territory (a vertex on the graph) until they run out. Once all troops are placed, players take…

Computer Science and Game Theory · Computer Science 2024-06-11 Jyothi Krishnan , Neeldhara Misra , Saraswati Girish Nanoti

An important feature of a dynamic game is its monitoring structure namely, what the players effectively see from the played actions. We consider games with arbitrary monitoring structures. One of the purposes of this paper is to know to…

Information Theory · Computer Science 2012-10-24 Maël Le Treust , Samson Lasaulce

This paper is concerned with the reconnaissance game that involves two mobile agents: the Intruder and the Defender. The Intruder is tasked to reconnoiter a territory of interest (target region) and then return to a safe zone (retreat…

Systems and Control · Electrical Eng. & Systems 2023-03-22 Yoonjae Lee , Efstathios Bakolas

We consider a search and rescue game introduced recently by the first author. An immobile target or targets (for example, injured hikers) are hidden on a graph. The terrain is assumed to dangerous, so that when any given vertex of the graph…

Data Structures and Algorithms · Computer Science 2023-04-10 Thomas Lidbetter , Yifan Xie

Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection. In previous research, it was assumed that all points of the…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-10-03 Huda Chuangpishit , Jurek Czyzowicz , Leszek Gasieniec , Konstantinos Georgiou , Tomasz Jurdzinski , Evangelos Kranakis