Bc. Matúš Abaffy

Master's thesis

Složitost řešení patrolovacích her na orientovaných grafech

Computational Complexity of Patrolling Games on Oriented Graphs
Abstract:
Patrolovacie hry sú hry dvoch hráčov hrané na grafoch. Jeden hráč, útočník, má za cieľ zaútočiť na niektoré uzly grafu, zatiaľ čo druhý hráč, obranca, sa snaží ochrániť tieto uzly svojou návštevou. Obranca musí "randomizovať", pretože jeho stratégia i pozícia sú útočníkovi známe. My prezentujeme kvadraticky exponenciálny algoritmus, ktorý počíta ε-optimálnu stratégiu pre obrancu pre danú patrolovaciu …more
Abstract:
Patrolling games are two-player games played on graphs. One player, the attacker, aims at attacking some of the nodes, while the other player, the defender, tries to protect those nodes by visiting them. The defender has to randomize as her strategy and position are both known to the attacker. We present a quadratically exponential algorithm which computes an ε-optimal defender’s strategy for a given …more
 

Keywords

patrolling games game theory complexity algorithm optimal strategy ε-optimality oriented graph multiple robots characteristic Stackelberg model
 
Language used: English
Date on which the thesis was submitted / produced: 8. 1. 2015
Identifier: https://is.muni.cz/th/l3smn/

Thesis defence

  • Date of defence: 11. 2. 2015
  • Supervisor: doc. RNDr. Tomáš Brázdil, Ph.D.
  • Reader: RNDr. Vojtěch Řehák, Ph.D.

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution