Stable Marriage Problem Looked as a Scientific Problem

The fact about stable marriage problem, it is actually a very classic and authoritative science problem in computer. Who in the world does not know what computer is, as they lay on so many places near you. Personal computer are able to be found everywhere. The existence of the personal computer with the addition of word processors, spreadsheets, spelling checkers, and laser printers, has been widely known, even among people who do not consider  themselves as “computer literate”, who care about this kind of electronic. Without us being aware, the occurrence of this technology has changed our everyday life as well.

To make it easier to understand this problem that can be found in the system of computer, the variables are given the set of men and women. Then, the matchmaker will be arranging the marriage in rounds, in where each of the men has to do a proposal to a woman. In return, it is possible for a woman not to get any of the proposals, or one proposal only, or even more than one proposal as well. For example, the case among Bob, Carol, Alice, and Ted. Based on wiki stable marriage problem can be divided into two; the first round is each of the unengaged man proposes to his first preference of the woman, the second one is the possibility that each the woman to reply “maybe” to her admirer, and “no” to all other suitors

CLICK HERE TO READ MY COMPLETE REVIEW

Then with algorithm, the case could be completed. First solved problem would be everyone gets married. Once a woman is engaged to someone, she will always be. Therefore, none of both men and women are unengaged. In the end, the woman has no choice but to say yes. The second guarantee of the algorithm is the stability of marriage. Both Alice and Bob are engaged to another person. If Bob loves Alice more than Carol, then Bon should propose Alice before Carol. The stable of Alice Marriage is seen here; when Alice accepts Bob’s proposal,  yet she does not marry him. When Alice rejects the Bob’s proposal, it means Alice has already with someone she loves the most, more than Bob.

In conclusion, just like other fields, computer science has this recent prospect named object oriented programming. The language of object oriented programming endorses the style of the construction of the program that is called stable marriage problem, which has been described before.