Linear Time Algorithm for Weak Parity Games
Logic in Computer Science
2008-12-18 v1
Abstract
We consider games played on graphs with the winning conditions for the players specified as weak-parity conditions. In weak-parity conditions the winner of a play is decided by looking into the set of states appearing in the play, rather than the set of states appearing infinitely often in the play. A naive analysis of the classical algorithm for weak-parity games yields a quadratic time algorithm. We present a linear time algorithm for solving weak-parity games.
Keywords
Cite
@article{arxiv.0805.1391,
title = {Linear Time Algorithm for Weak Parity Games},
author = {Krishnendu Chatterjee},
journal= {arXiv preprint arXiv:0805.1391},
year = {2008}
}
Comments
7 pages, EECS UC Berkeley Technical Report