Dynamic Complexity of Parity Games with Bounded Tree-Width
Computational Complexity
2016-10-04 v1 Computer Science and Game Theory
Abstract
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of two-player parity games over graphs of bounded tree-width, where updates may add or delete edges, or change the owner or color of states. We show that this problem is in DynFO (with LOGSPACE precomputation); this is achieved by a reduction to a Dyck-path problem on an acyclic automaton.
Keywords
Cite
@article{arxiv.1610.00571,
title = {Dynamic Complexity of Parity Games with Bounded Tree-Width},
author = {Patricia Bouyer and Vincent Jugé and Nicolas Markey},
journal= {arXiv preprint arXiv:1610.00571},
year = {2016}
}
Comments
33 pages, 3 figures