A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it

Details A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it

2009-01-18

arxiv.org/abs/0901.2731v1

Computer Science

Computer Science and Game Theory

Scientific paper

This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to Voege and Jurdziski. First, we informally show which structures are difficult to solve for the algorithm. Second, we outline a family of games of quadratic size on which the algorithm requires exponentially many strategy iterations, answering in the negative the long-standing question whether this algorithm runs in polynomial time. Additionally we note that the same family of games can be used to prove a similar result w.r.t. the strategy improvement variant by Schewe.

Affiliated with

Also associated with

No associations

Rating

A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-702285