A stable roommate problem with 4 students a, b, c, d is defined as follows. Each student ranks the other three in strict order o
f preference. A matching is defined as the separation of the students into two disjoint pairs. A matching is stable if no two separated students prefer each other to their current roommates. Does a stable matching always exist
Each student ranks the other three in strict order of preference.
Step-by-step explanation:
When 4 different students from different background and personality lives together, there seems to be a room for the problems and stability between them. When the problem of stability arises, it would be as a result of the other 3 students ranking each other in strict order of preference regarding to their relationship and association.
No not all diagonal lines are lines of symmetry! Because if you take a piece of notebook paper and fold it in half the side do not match up! hope this helps :)
