|
Title
|
|
|
|
Quantitative games under failures
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| We study a generalisation of sabotage games, a model of dynamic network games introduced by van Benthem [16]. The original definition of the game is inherently finite and therefore does not allow one to model infinite processes. We propose an extension of the sabotage games in which the first player (Runner) traverses an arena with dynamic weights determined by the second player (Saboteur). In our model of quantitative sabotage games, Saboteur is now given a budget that he can distribute amongst the edges of the graph, whilst Runner attempts to minimise the quantity of budget witnessed while completing his task. We show that, on the one hand, for most of the classical cost functions considered in the literature, the problem of determining if Runner has a strategy to ensure a cost below some threshold is EXPTIME-complete. On the other hand, if the budget of Saboteur is fixed a priori, then the problem is in PTIME for most cost functions. Finally, we show that restricting the dynamics of the game also leads to better complexity. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
LIPIcs : Leibniz International Proceedings in Informatics. - Place of publication unknown
| |
|
Source (book)
|
|
|
|
35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015), December 16-18, 2015, Bangalore, India / Harsha, Prahladh [edit.]; et al.
| |
|
Publication
|
|
|
|
Germany
:
Schloss Dagstuhl, Leibniz-Zentrum fuer Informatik
,
2015
| |
|
ISBN
|
|
|
|
978-3-939897-97-2
| |
|
Volume/pages
|
|
|
|
45
(2015)
, p. 293-306
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|
Full text (open access)
|
|
|
|
| |
|