Down the Borel Hierarchy: Solving Muller Games via Safety Games
Logic in Computer Science
2012-10-10 v1 Computer Science and Game Theory
Abstract
We transform a Muller game with n vertices into a safety game with (n!)^3 vertices whose solution allows to determine the winning regions of the Muller game and to compute a finite-state winning strategy for one player. This yields a novel antichain-based memory structure and a natural notion of permissive strategies for Muller games. Moreover, we generalize our construction by presenting a new type of game reduction from infinite games to safety games and show its applicability to several other winning conditions.
Cite
@article{arxiv.1210.2457,
title = {Down the Borel Hierarchy: Solving Muller Games via Safety Games},
author = {Daniel Neider and Roman Rabinovich and Martin Zimmermann},
journal= {arXiv preprint arXiv:1210.2457},
year = {2012}
}
Comments
In Proceedings GandALF 2012, arXiv:1210.2028