Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
type: Item
instance of: scholarly article
title: Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
zbMATH Open document ID: 1251.68254
author: Nicola Basilico
author: Nicola Gatti
author: Francesco Amigoni
published in: Artificial Intelligence
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 68T40
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 6106678
zbMATH Keywords: security games
zbMATH Keywords: adversarial patrolling
zbMATH Keywords: algorithmic game theory
describes a project that uses: AMPL
describes a project that uses: GameShrink
describes a project that uses: Radish
MaRDI profile type: Publication
full work available at URL: j.artint.2012.03.003
OpenAlex ID: W2032243783
Wikidata QID: Q115101553
cites work: Randomized Pursuit-Evasion in Graphs
cites work: Infiltration games on arbitrary graphs
cites work: Nonlinear Programming
cites work: The period routing problem
cites work: Multi-robot area patrol under frequency constraints
cites work: The Hide and Seek Game of Von Neumann
cites work: A Modeling Language for Mathematical Programming
cites work: Game theory
cites work: Search games
cites work: Lossless abstraction of imperfect information games
cites work: Temporal linear relaxation in IBM ILOG CP optimizer
cites work: Computing optimal randomized resource allocations for massive security games
cites work: Vehicle Routing with Time Windows
cites work: Efficient computation of equilibria for extensive two-person games
cites work: Sequential Equilibria
cites work: Q4413473
cites work: Patrol mobile robots and chaotic trajectories
cites work: Q3221403
cites work: A practical solution approach for the cyclic inventory routing problem
cites work: Perfect Equilibrium in a Bargaining Model
cites work: Ambushing Random Walks I: Finite Models
cites work: Multiagent Systems
cites work: Special cases of traveling salesman and repairman problems with time windows
cites work: Two-Person Zero-Sum Games for Network Interdiction
cites work: A distributed ant algorithm for efficiently patrolling a network
DOI: 10.1016/J.ARTINT.2012.03.003
Recommended article: Q5132749
Recommended article: Solving partially observable agent‐intruder games with an application to border security problems
Recommended article: A continuous-time Markov Stackelberg security game approach for reasoning about real patrol strategies
Recommended article: Dynamical and Game-Theoretical Approaches to an Optimal Patrol Problem
Recommended article: Security games with probabilistic constraints on the agent's strategy
Recommended article: Handling a Kullback--Leibler divergence random walk for scheduling effective patrol strategies in Stackelberg security games
Recommended article: Addressing Scalability and Robustness in Security Games with Multiple Boundedly Rational Adversaries
Recommended article: Faster algorithms for security games on matroids
description: scientific article; zbMATH DE number 6106678