Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Kuvalekar et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: