Planning and learning in security games

No abstract is available for this paper.

• Publication year

  2013

• Venue

  SeCO Workshops

• Publication date

  2013-06-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/2509013.2509019
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Analyzing the Effectiveness of Adversary Modeling in Security Games

  2013cited by this paper
• Game-theoretic randomization for security patrolling with dynamic execution uncertainty

  2013cited by this paper
• Security scheduling for real-world networks

  2013cited by this paper
• TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems

  2012cited by this paper
• A unified method for handling discrete and continuous uncertainty in Bayesian Stackelberg games

  2012cited by this paper
• Patrol Strategies to Maximize Pristine Forest Area

  2012cited by this paper
• Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned

  2011cited by this paper
• Risk-Averse Strategies for Security Games with Execution and Observational Uncertainty

  2011cited by this paper
• Improving Resource Allocation Strategy against Human Adversaries in Security Games

  2011cited by this paper
• Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up

  2011cited by this paper
• Computing the optimal strategy to commit to

  2006cited by this paper

• No citing papers are available for this paper.