I'm not sure why this paper would be of special interest to people outside the Stable Matching community. While interesting, yet another variation of the Gale-Shapley algorithm isn't ground-breaking, and both writing and the introductory section need more work [in particular, it doesn't make sense to say that an algorithm is "stable" (only its output is), and algorithms cannot "be" O(n^2) either, but merely run in that time].