@misc{5394, abstract = {We consider two-player games played on graphs with request-response and finitary Streett objectives. We show these games are PSPACE-hard, improving the previous known NP-hardness. We also improve the lower bounds on memory required by the winning strategies for the players.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Horn, Florian}, issn = {2664-1690}, pages = {11}, publisher = {IST Austria}, title = {{Improved lower bounds for request-response and finitary Streett games}}, doi = {10.15479/AT:IST-2009-0002}, year = {2009}, }