Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  presents a new lor bound for the discrete strategy improvement algorithm for solving parity games due to Voege and Jurdzinski. First,  informally show which structures are difficult to solve for the algorithm. Second,  outline a family of games on which the algorithm requires exponentially many strategy iterations, ansring in the negative the long-standing question whether this algorithm runs in polynomial time. Additionally  note that the same family of games can be used to prove a similar result w.r.t. the strategy improvement variant by Sche as ll as the strategy iteration for solving discounted payoff games due to Puri.
['Oliver Friedmann']
I am writing a research paper on a idea An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
[{"from": "human", "value": "I am writing a research paper on a idea An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  presents a new lor bound for the discrete strategy improvement algorithm for solving parity games due to Voege and Jurdzinski. First,  informally show which structures are difficult to solve for the algorithm. Second,  outline a family of games on which the algorithm requires exponentially many strategy iterations, ansring in the negative the long-standing question whether this algorithm runs in polynomial time. Additionally  note that the same family of games can be used to prove a similar result w.r.t. the strategy improvement variant by Sche as ll as the strategy iteration for solving discounted payoff games due to Puri."}]