Methods and algorithms for infinite Bayesian Stackelberg security games. (Extended abstract)
From MaRDI portal
Recommendations
- Stackelberg vs. Nash in security games: an extended investigation of interchangeability, equivalence, and uniqueness
- Improving resource allocation strategies against human adversaries in security games: an extended study
- Game-theoretic patrolling with dynamic execution uncertainty and a case study on a real transit system
- Tackling sequential attacks in security games
- Protecting moving targets with multiple mobile resources
Cited in
(11)- Counterfactual regret minimization for integrated cyber and air defense resource allocation
- Coordinating resources in Stackelberg security games
- Using one-sided partially observable stochastic games for solving zero-sum security games with sequential attacks
- Stackelberg vs. Nash in security games: an extended investigation of interchangeability, equivalence, and uniqueness
- Solving cyber alert allocation Markov games with deep reinforcement learning
- Analysis of security policy in transit hub via incomplete information games
- Improving resource allocation strategies against human adversaries in security games: an extended study
- Game-theoretic patrolling with dynamic execution uncertainty and a case study on a real transit system
- Handling a Kullback--Leibler divergence random walk for scheduling effective patrol strategies in Stackelberg security games
- A Stackelberg game model for resource allocation in cargo container security
- Criminals can be leaders: an endogenous timing approach to security games
This page was built for publication: Methods and algorithms for infinite Bayesian Stackelberg security games. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3056874)