Složitost řešení patrolovacích her na orientovaných grafech – Bc. Matúš Abaffy
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 …moreAbstract:
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
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
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 informatikyMasaryk University
Faculty of InformaticsMaster programme / field:
Informatics / Theoretical Informatics
Theses on a related topic
-
Experimental evaluation of heuristic improvements of the Bellman-Ford algorithm
Šimon Soták -
Black-Box Hyperparameter Tuning for Risk-Constrained Reinforcement Learning Algorithm
Ján Petrák -
A Hybrid Book Recommender System Utilizing Diverse-Item Selection Algorithm
Martin Balucha -
Extending the Synthesis Algorithm for Consumption MDPs with LTL Objectives
Dávid Meluš -
A Game-Playing Algorithm for Briscola
Samuel Gazda -
Euclid's algorithm for large integers
Tomáš Marek -
Customers Classification using Recency Frequency, Monetary value (RFM), and K-means clustering algorithm
Mark Azietaku -
Implementation and security analysis of construction algorithm of Sigma-LFSR
Susil Kumar Bishoi