New challenges in search and patrolling games

Search and patrolling games are concerned with the study of problems in which a mobile searcher must locate an adversarial hider within a given environment. Such problems are not only important from the mathematical point of view, but also have significant practical applications, such as search-and-rescue missions, the study of predator-prey interactions, the search for natural resources, and the patrolling of sensitive facilities. The broad objective, within this area, is to find efficient search and patrolling strategies in a variety of settings and optimization objectives. 

This Lorentz Center workshop aims to bring together researchers in Computer Science and Operations Research so as to address both the algorithmic and the mathematical aspects of search and patrolling games. More specifically, the workshop will address novel topics such as searching with external hints and machine-learned advice, new techniques from dynamic games and control theory in the analysis of search games, and topics related to the approximability of the underlying objectives.