Instability of Stable Matching: A Dynamic Trust Approach

Rejwana Haque; Sifat E Jahan

Instability of Stable Matching: A Dynamic Trust Approach

Rejwana Haque *

Contact

Sifat E Jahan

Contact

Instability of Stable Matching: A Dynamic Trust Approach

Article Fingerprint

ReserarchID

035LH

Instability of Stable Matching: A Dynamic Trust Approach Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant

This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

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

Reference Format

1. Elliot Anshelevich,Onkar Bhardwaj,Martin Hoefer (2013). Friendship and Stable Matching. Lecture Notes in Computer Science, 49-60.
2. Anupam Das,Mohammad Islam (2012). SecuredTrust: A Dynamic Trust Computation Model for Secured Communication in Multiagent Systems. IEEE Transactions on Dependable and Secure Computing, 9(2), 261-274.
3. Tamás Fleiner,Robert Irving,David Manlove (2011). An algorithm for a super-stable roommates problem. Theoretical Computer Science, 412(50), 7059-7065.
4. Patrik Floréen,Petteri Kaski,Valentin Polishchuk,Jukka Suomela (2010). Almost Stable Matchings by Truncating the Gale–Shapley Algorithm. Algorithmica, 58(1), 102-118.
5. Philippe Golle (2006). A private stable matching algorithm. International Conference on Financial Cryptography and Data Security, 65-80.
6. Dan Gusfield,Robert Irving (1989). The stable marriage problem: structure and algorithms. The stable marriage problem: structure and algorithms
7. Robert Irving (1985). An efficient algorithm for the stable roommates problem. Journal of Algorithms, 6(4), 577-595.
8. Harold Kuhn (1955). The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1-2), 83-97.
9. Bo Lang (2010). A computational trust model for access control in P2P. Science China Information Sciences, 53(5), 896-910.
10. S Marsh (1994). Formalizing Trust as a Concept. Formalizing Trust as a Concept
11. D Mcknight,N Chervany (2001). Conceptualizing trust: a typology and e-commerce customer relationships model. Proceedings of the 34th Annual Hawaii International Conference on System Sciences, 10.
12. Eytan Ronn (1990). NP-complete stable matching problems. Journal of Algorithms, 11(2), 285-304.
13. Alvin Roth,John Vande,Vate (1990). Random paths to stability in two-sided matching. Econometrica: Journal of the Econometric Society, 1475-1480.
14. Chung-Piaw Teo,Jay Sethuraman,Wee-Peng Tan (2001). Gale-shapley stable marriage problem revisited: Strategic issues and applications. Management Science, 47(9), 1252-1267.
15. Yuhui Zhong,Bharat Bhargava,Yi Lu,Pelin Angin (2015). A Computational Dynamic Trust Model for User Authorization. IEEE Transactions on Dependable and Secure Computing, 12(1), 1-15.
16. David Gale,Lloyd Shapley (1962). College Admissions and the Stability of Marriage. The American Mathematical Monthly, 69(1), 9-15.
17. Eric Mcdermid,David Manlove (2010). Keeping partners together: algorithmic results for the hospitals/residents problem with couples. Journal of Combinatorial Optimization, 19(3), 279-303.

Download References

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, Sifat E Jahan. 2018. "Instability of Stable Matching: A Dynamic Trust Approach". Global Journal of Computer Science and Technology - G: Interdisciplinary GJCST-G Volume 18 (GJCST Volume 18 Issue G3).

More Citation Formats

Select Citation Style:

Download Citation

GJCST Volume 18 Issue G3

Explore Journals Explore Volume Read This Issue

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords

Not Found

Classification

GJCST-G Classification H.3.m

Submission ReceivedDecember 9, 2017
Peer Review Double Blind
Handling Editor
Accepted January 5, 2018
Published June 9, 2018

Version of record

v1.2

Issue date

June 9, 2018

Language

English

Order Article Reprint

Experience 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.

View in VR

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.

View in 3D

Article Matrices

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

Total Views (Real + Logic): 1729

Total Downloads (simulated): 139

Publish Date: 2018 01, Mon

Monthly Totals (Real + Logic):

Month 1: 41 views
Month 2: 28 views
Month 3: 30 views
Month 4: 53 views
Month 5: 32 views
Month 6: 23 views
Month 7: 33 views
Month 8: 27 views
Month 9: 48 views
Month 10: 43 views
Month 11: 39 views
Month 12: 25 views
Month 13: 22 views
Month 14: 24 views
Month 15: 27 views
Month 16: 40 views
Month 17: 30 views
Month 18: 35 views
Month 19: 28 views
Month 20: 30 views
Month 21: 36 views
Month 22: 24 views
Month 23: 42 views
Month 24: 22 views
Month 25: 22 views
Month 26: 41 views
Month 27: 33 views
Month 28: 28 views
Month 29: 21 views
Month 30: 34 views
Month 31: 28 views
Month 32: 39 views
Month 33: 35 views
Month 34: 24 views
Month 35: 19 views
Month 36: 37 views
Month 37: 25 views
Month 38: 18 views
Month 39: 22 views
Month 40: 32 views
Month 41: 20 views
Month 42: 37 views
Month 43: 12 views
Month 44: 31 views
Month 45: 38 views
Month 46: 41 views
Month 47: 25 views
Month 48: 21 views
Month 49: 26 views
Month 50: 49 views
Month 51: 19 views
Month 52: 26 views
Month 53: 25 views
Month 54: 37 views
Month 55: 24 views
Month 56: 26 views
Month 57: 25 views
Month 58: 23 views
Month 59: 39 views
Month 60: 24 views
Month 61: 40 views
Month 62: 17 views
Month 63: 13 views
Month 64: 40 views
Month 65: 21 views
Month 66: 23 views
Month 67: 19 views
Month 68: 25 views
Month 69: 23 views
Month 70: 42 views
Month 71: 39 views
Month 72: 42 views
Month 73: 26 views
Month 74: 28 views
Month 75: 34 views
Month 76: 20 views
Month 77: 29 views
Month 78: 34 views
Month 79: 39 views
Month 80: 40 views
Month 81: 22 views
Month 82: 25 views
Month 83: 31 views
Month 84: 28 views
Month 85: 46 views
Month 86: 25 views
Month 87: 46 views
Month 88: 11 views
Month 89: 31 views
Month 90: 26 views
Month 91: 23 views
Month 92: 42 views
Month 93: 33 views
Month 94: 20 views
Month 95: 51 views
Month 96: 46 views
Month 97: 37 views
Month 98: 25 views
Month 99: 23 views
Month 100: 17 views
Month 101: 40 views
Month 102: 33 views
Month 103: 26 views
Month 104: 45 views
Month 105: 65 views
Month 106: 54 views

Total Views: 1.7K

Total Downloads: 139

All Trends