© 2018. Rejwana Haque & Sifat E Jahan. This is a research/review paper, distributed under the terms of the Creative Commons
Attribution-Noncommercial 3.0 Unported License http://creativecommons.org/licenses/by-nc/3.0/), permitting all non-commercial
use, distribution, and reproduction in any medium, provided the original work is properly cited.
Global Journal of Computer Science and Technology: G
Interdisciplinary
Volume 18 Issue 3 Version 1.0 Year 2018
Type: Double Blind Peer Reviewed International Research Journal
Publisher: Global Journals
Online ISSN: 0975-4172 & Print ISSN: 0975-4350
Instability of Stable Matching: A Dynamic Trust Approach
By Rejwana Haque & Sifat E Jahan
Abstract- 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.
Keywords: stable matching, dynamic trust model, stable marriage problem, trust management,
algorithm instability.
GJCST-G Classification: H.3.m
InstabilityofStableMatchingADynamicTrustApproach
Strictly as per the compliance and regulations of: