Algorithms for stable matching with indifferences

Chi Kit Lam
In the stable matching problem, given a two-sided matching market where each agent has ordinal preferences over the agents on the other side, we would like to find a bipartite matching such that no pair of agents prefer each other to their partners. Indifferences in preferences of the agents arise naturally in large-scale centralized matching schemes. We consider stable matching models where indifferences may occur in the preferences and address some of the related algorithmic...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.