TY - GEN AB - 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. AU - Chatterjee, Krishnendu AU - Henzinger, Thomas A AU - Horn, Florian ID - 5394 SN - 2664-1690 TI - Improved lower bounds for request-response and finitary Streett games ER -