Defending a city from multi-drone attacks: a sequential Stackelberg security games approach
From MaRDI portal
Cites work
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Cops and invisible robbers: the cost of drunkenness
- Defense coordination in security games: equilibrium analysis and mechanism design
- Game-theoretic patrolling with dynamic execution uncertainty and a case study on a real transit system
- scientific article; zbMATH DE number 795217 (Why is no real title available?)
- scientific article; zbMATH DE number 7368358 (Why is no real title available?)
- scientific article; zbMATH DE number 3262139 (Why is no real title available?)
- scientific article; zbMATH DE number 3356499 (Why is no real title available?)
- Multiplayer Reach-Avoid Games via Pairwise Outcomes
- On generalized Stackelberg strategies
- Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition
- Sequential Stackelberg equilibria in two-person games
- Stackelberg vs. Nash in security games: an extended investigation of interchangeability, equivalence, and uniqueness
- Tackling sequential attacks in security games
- The game of cops and robbers on graphs
- Using one-sided partially observable stochastic games for solving zero-sum security games with sequential attacks
- Zero-visibility cops and robber and the pathwidth of a graph
This page was built for publication: Defending a city from multi-drone attacks: a sequential Stackelberg security games approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884998)