Matching is of one of the essential problems in computer science and finding the stable matching is often difficult. For example, matching the medical students to hospitals where each student has its own preferences as well as each hospital has its own category in order to select the interns it can be difficult. Therefore there are many constraints that one needs to look at before solving matching problems. There are some algorithms which ensure that is possible to find a stable matching solution of this type of problems if any exists. In this paper, the instability of stable matching algorithm in dynamic environment has been demonstrated. The approach consists in mapping a specific stable matching problem (stable marriage problem) which has a stable solution into a dynamic environment where the instability is shown by using dynamic trust model
