Abstract
Our study of two-sided matching in the Stable Marriage Problem tries to provide a solution for the uncertainty in preference. We try to investigate the Random Order Mechanism (ROM) by Roth and Vande when dealing with uncertain preference in the matching problem. To achieve stability in matching with uncertain preferences, one must employ a set of matches that is stable against all possible preferences. To determine the random order mechanism's efficiency when dealing with uncertain preferences, we compared it to the Gale-Shapley. The random order mechanism can be utilized to find stable matches with uncertain preferences. Furthermore, when the random order mechanism is used, the stable matches generated are more varied, providing a more detailed probability of stability.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
