In this paper we show the polynomial time decidability of the stability property under FFS in the case that the adversary can solve ties arbitrarily. This results follows from a characterization of the stability property in terms of a family of forbidden subgraphs.Postprint (published version