Instability of Stable Matching: A Dynamic Trust Approach

α
Rejwana Haque
Rejwana Haque
σ
Sifat E Jahan
Sifat E Jahan

Send Message

To: Author

Instability of Stable Matching: A Dynamic Trust Approach

Article Fingerprint

ReserarchID

035LH

Instability of Stable Matching: A Dynamic Trust Approach Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

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.

References

17 Cites in Article
  1. Elliot Anshelevich,Onkar Bhardwaj,Martin Hoefer (2013). Friendship and Stable Matching.
  2. Anupam Das,Mohammad Islam (2012). SecuredTrust: A Dynamic Trust Computation Model for Secured Communication in Multiagent Systems.
  3. Tamás Fleiner,Robert Irving,David Manlove (2011). An algorithm for a super-stable roommates problem.
  4. Patrik Floréen,Petteri Kaski,Valentin Polishchuk,Jukka Suomela (2010). Almost Stable Matchings by Truncating the Gale–Shapley Algorithm.
  5. Philippe Golle (2006). A private stable matching algorithm.
  6. Dan Gusfield,Robert Irving (1989). The stable marriage problem: structure and algorithms.
  7. Robert Irving (1985). An efficient algorithm for the stable roommates problem.
  8. Harold Kuhn (1955). The Hungarian method for the assignment problem.
  9. Bo Lang (2010). A computational trust model for access control in P2P.
  10. S Marsh (1994). Formalizing Trust as a Concept.
  11. D Mcknight,N Chervany (2001). Conceptualizing trust: a typology and e-commerce customer relationships model.
  12. Eytan Ronn (1990). NP-complete stable matching problems.
  13. Alvin Roth,John Vande,Vate (1990). Random paths to stability in two-sided matching.
  14. Chung-Piaw Teo,Jay Sethuraman,Wee-Peng Tan (2001). Gale-shapley stable marriage problem revisited: Strategic issues and applications.
  15. Yuhui Zhong,Bharat Bhargava,Yi Lu,Pelin Angin (2015). A Computational Dynamic Trust Model for User Authorization.
  16. David Gale,Lloyd Shapley (1962). College Admissions and the Stability of Marriage.
  17. Eric Mcdermid,David Manlove (2010). Keeping partners together: algorithmic results for the hospitals/residents problem with couples.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

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): .

Download Citation

Issue Cover
GJCST Volume 18 Issue G3
Pg. 19- 24
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-G Classification: H.3.m
Version of record

v1.2

Issue date

June 9, 2018

Language
en
Experiance in AR

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.

Read in 3D

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.

Article Matrices
Total Views: 5555
Total Downloads: 1595
2026 Trends
Related Research

Published Article

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.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Instability of Stable Matching: A Dynamic Trust Approach

Rejwana Haque
Rejwana Haque
Sifat E Jahan
Sifat E Jahan

Research Journals