Article Fingerprint
ReserarchID
035LH
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.
Rejwana Haque. 2018. \u201cInstability of Stable Matching: A Dynamic Trust Approach\u201d. Global Journal of Computer Science and Technology - G: Interdisciplinary GJCST-G Volume 18 (GJCST Volume 18 Issue G3): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 102
Country: Bangladesh
Subject: Global Journal of Computer Science and Technology - G: Interdisciplinary
Authors: Rejwana Haque, Sifat E Jahan (PhD/Dr. count: 0)
View Count (all-time): 234
Total Views (Real + Logic): 5553
Total Downloads (simulated): 1601
Publish Date: 2018 06, Sat
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
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.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.