A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs
From MaRDI portal
Publication:1735189
DOI10.1016/j.ejor.2019.02.017zbMath1431.91063OpenAlexW2913035305WikidataQ128422678 ScholiaQ128422678MaRDI QIDQ1735189
Publication date: 28 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.02.017
Hierarchical games (including Stackelberg games) (91A65) Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Infrastructure security games
- A single-shot game of multi-period inspection
- On generalized Stackelberg strategies
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
- Quantal response equilibria for normal form games
- Patrolling a perimeter
- An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information
- Interdicting a Nuclear-Weapons Project
- Security and Game Theory
- An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression
- Sequential Shortest Path Interdiction with Incomplete Information
- Sequential Interdiction with Incomplete Information and Learning
- Extensive Games
- A method for the solution of certain non-linear problems in least squares
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs
