Give an example of an instance of stable matching problem with at least three different stable matchings. That is, for some positive integer n, give ranking lists for each of n doctors L1, ..., Ln and ranking lists for each of n hospitals L01, ..., L0n su
technical writing
Description
Give an example of an instance of stable matching problem with at least three different stable matchings. That is, for some positive integer n, give ranking lists for each of n doctors L1, ..., Ln and ranking lists for each of n hospitals L01, ..., L0n such that there are at least three different stable matchings with these rankings. To get full points, it is enough to specify the lists and write down (or clearly draw) three stable matchings in your instance.
