Parity and Streett Games with Costs
  We consider two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses. Both conditions generalize the corresponding classical omega-regular conditions and the corresponding finitary conditions. For parity games with costs we show that the first player has positional winning strategies and that determining the winner lies in NP and coNP. For Streett games with costs we show that the first player has finite-state winning strategies and that determining the winner is EXPTIME-complete. The second player might need infinite memory in both games. Both types of games with costs can be solved by solving linearly many instances of their classical variants. 
Nathana\"el Fijalkow (LIAFA, Universit\'e Paris 7 and Institute of   Informatics, University of Warsaw), Martin Zimmermann (...
cs.LO cs.CC cs.GT