Parity games is one of the rare problems we know to be in $NP\cap coNP$, but don't know to be in $P$. Since most other candidates for such languages were eventually shown to be in $P$, it is not unreasonable to believe that a polynomial time algorithm will be found.