I've looked around lot and I haven't been able to find any algorithms for to the traditional stable marriage problem (I'm not talking about any of its variants like the roommate problem) besides the Gale-Shapely one. Is that because there's simply been no reason for trying to find another one, or is a completely different algorithm not been found despite research, or have I just missed the ones that exist?
Sorry for not including this initially. For those who're unfamiliar with the stable marriage problem here it is in its simplest form from good old wikipedia:
Given n men and n women, where each person has ranked all members of the opposite sex in order of preference, marry the men and women together such that there are no two people of opposite sex who would both rather have each other than their current partners. When there are no such pairs of people, the set of marriages is deemed stable.
In other words, an unstable matching is one which contains members of the oposite sex who have not been married but simulatnously prefere each other to their assigned spouse.