Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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 beten requests and their responses. Both conditions generalize the corresponding classical omega-regular conditions as ll as the corresponding finitary conditions.#R##N##R##N#For cost-parity games  show that the first player has positional winning strategies and that determining the winner lies in NP intersection Co-NP. For cost-Streett games  show that the first player has finite-state winning strategies and that determining the winner is EXPTIME-complete. This unifies the complexity results for the classical and finitary variants of these games. Both types of cost games can be solved by solving linearly many instances of their classical variants.
['Nathanaël Fijalkow', 'Martin Zimmermann']
I am writing a research paper on a idea Cost-Parity and Cost-Streett Games
[{"from": "human", "value": "I am writing a research paper on a idea Cost-Parity and Cost-Streett Games"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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 beten requests and their responses. Both conditions generalize the corresponding classical omega-regular conditions as ll as the corresponding finitary conditions.#R##N##R##N#For cost-parity games  show that the first player has positional winning strategies and that determining the winner lies in NP intersection Co-NP. For cost-Streett games  show that the first player has finite-state winning strategies and that determining the winner is EXPTIME-complete. This unifies the complexity results for the classical and finitary variants of these games. Both types of cost games can be solved by solving linearly many instances of their classical variants."}]