Playing Pushdown Parity Games in a Hurry
Computer Science and Game Theory
2012-10-10 v1
Abstract
We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown parity games and a finite-duration variant. This allows us to determine the winner of a pushdown parity game by solving a reachability game on a finite tree.
Keywords
Cite
@article{arxiv.1210.2458,
title = {Playing Pushdown Parity Games in a Hurry},
author = {Wladimir Fridman and Martin Zimmermann},
journal= {arXiv preprint arXiv:1210.2458},
year = {2012}
}
Comments
In Proceedings GandALF 2012, arXiv:1210.2028