We propose a new algorithm in the two-sided marriage market wherein both sides of the market propose in each round. The algorithm always yields a stable matching. Moreover, the outcome is a Rawlsian stable matching if the number of men and women is equal. Lastly, the algorithm can be computed in polynomial time and, from a practical standpoint, can be used in markets where fairness considerations are important.