Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
research [2015/09/01 11:36]
Antonin Kucera [Security games]
research [2015/09/01 11:37] (current)
Antonin Kucera [Security games]
Line 49: Line 49:
   * [[https://​is.muni.cz/​auth/​rozpis/​tema?​fakulta=1433;​obdobi=6383;​studium=361256;​sorter=vedouci;​balik=1275;​tema=243344;​uplne_info=1|Algorithmic Analysis of Patrolling Games.]] ​ A central problem in security and operational research is how to deploy limited security resources (such as police patrols, security guards, etc.) to maximize their effectiveness. Clearly, police patrols cannot be everywhere all the time, security guards cannot check every door every minute, etc., which raises a crucial question how to utilize them best. This question can be formalized as the strategy synthesis problem in //​patrolling games// where the goal of one player (the patroller) is to visit the targets so that the probability of discovering the attack performed by the other player is maximized. The goal of the project is to develop efficient strategy synthesis algorithms for patrolling games and solve some of the open game-theoretic questions about these games.   * [[https://​is.muni.cz/​auth/​rozpis/​tema?​fakulta=1433;​obdobi=6383;​studium=361256;​sorter=vedouci;​balik=1275;​tema=243344;​uplne_info=1|Algorithmic Analysis of Patrolling Games.]] ​ A central problem in security and operational research is how to deploy limited security resources (such as police patrols, security guards, etc.) to maximize their effectiveness. Clearly, police patrols cannot be everywhere all the time, security guards cannot check every door every minute, etc., which raises a crucial question how to utilize them best. This question can be formalized as the strategy synthesis problem in //​patrolling games// where the goal of one player (the patroller) is to visit the targets so that the probability of discovering the attack performed by the other player is maximized. The goal of the project is to develop efficient strategy synthesis algorithms for patrolling games and solve some of the open game-theoretic questions about these games.
    
-This research area is rich and new topics for both Bachelor and Master theses can easily be found. Interested students are advised to contact ​the persons below directly. +This research area is rich and new topics for both Bachelor and Master theses can easily be found. Interested students are advised to contact [[http://​www.fi.muni.cz/​~xbrazdil/​|Tomáš Brázdil]], [[http://​www.fi.muni.cz/​usr/​kucera/​|Antonín Kučera]], and [[http://​www.fi.muni.cz/​~xrehak/​|Vojtěch Řehák]]
- +
-Contact: ​[[http://​www.fi.muni.cz/​~xbrazdil/​|Tomáš Brázdil]], [[http://​www.fi.muni.cz/​usr/​kucera/​|Antonín Kučera]], and [[http://​www.fi.muni.cz/​~xrehak/​|Vojtěch Řehák]]+
 ==== Static program analysis of sequential imperative and low-level programs ==== ==== Static program analysis of sequential imperative and low-level programs ====
  
research.txt · Last modified: 2015/09/01 11:37 by Antonin Kucera