Question: 4. When we discussed in class the stable marriage algorithm, we did not discuss how exactly a woman receiving proposals from two men b, b2

4. When we discussed in class the stable marriage algorithm, we did not discuss how exactly a woman receiving proposals from two men b, b2 decides which one to reject. For the algorithm to run in O(na), she should be able to do so in O(1) time. Note that the O(na) proof shown in class is only discussing the number of days, and fur- thermore, the overall description of the algorithm was lacking many details. In particular, we did not discuss how a female could pick her top proposer each day. Explain exactly how this part of the algorithm works. You might need some pre-processing of the data before running the algorithm itself. 3
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
