In this Stable Marriage problem all boys have identical preferences. I was wondering how many proposals would it take to terminate this boy-orientated GS. (By boy-orientated I mean the boys are proposing)
I know the Gale-Shapley algorithm terminates after n(n-1)+1 proposals but is this the same for this question. And if it is can anyone justify it?
Thank you for the help/advice