@incollection{, DCCD731ED28B9973D52B6C8EE5622829 , author={{RejwanaHaque} and {Sifat EJahan}}, journal={{Global Journal of Computer Science and Technology}}, journal={{GJCST}}0975-41720975-435010.34257/gjcst, address={Cambridge, United States}, publisher={Global Journals Organisation}1831924 } @incollection{b0, , title={{Friendship and stable matching}} , author={{ ElliotAnshelevich } and { OnkarBhardwaj } and { MartinHoefer }} , booktitle={{European Symposium on Algorithms}} Berlin, Heidelberg , publisher={Springer} , year={2013} } @incollection{b1, , title={{SecuredTrust: a dynamic trust computation model for secured communication in multiagent systems}} , author={{ AnupamDas } and { Mohammad MahfuzulIslam }} , journal={{IEEE Transactions on Dependable and Secure Computing}} 9 2 , year={2012} } @incollection{b2, , title={{An algorithm for a super-stable roommates problem}} , author={{ Fleiner } and { RobertWTams } and { DavidFIrving } and { Manlove }} , journal={{Theoretical Computer Science}} 412 50 , year={2011} } @incollection{b3, , title={{Almost stable matchings by truncating the GaleShapley algorithm}} , author={{ PatrikFloren } and { PetteriKaski } and { ValentinPolishchuk } and { JukkaSuomela }} , journal={{Algorithmica}} 58 1 , year={2010} } @incollection{b4, , title={{A private stable matching algorithm}} , author={{ PhilippeGolle }} , booktitle={{International Conference on Financial Cryptography and Data Security}} } @book{b5, , title={{}} , author={{ Springer }} , year={2006} , address={Berlin, Heidelberg} } @book{b6, , title={{The stable marriage problem: structure and algorithms}} , author={{ DanGusfield } and { RobertWIrving }} , year={1989} , publisher={MIT press} } @incollection{b7, , title={{An efficient algorithm for the stable roommates problem}} , author={{ RobertWIrving }} , journal={{Journal of Algorithms}} 6 4 , year={1985} } @incollection{b8, , title={{The Hungarian method for the assignment problem}} , author={{ HaroldWKuhn }} , journal={{Naval Research Logistics (NRL)}} 2 12 , year={1955} } @incollection{b9, , title={{A computational trust model for access control in P2P}} , author={{ BoLang }} , journal={{Science China Information Sciences}} 53 5 , year={2010} } @book{b10, , title={{PhD diss., PhD dissertation-Dept}} , author={{ SMarsh }} , year={1994} of Computer Science and Math., Univ. of Stirling , note={Formalizing Trust as a Concept} } @incollection{b11, , title={{Conceptualizing trust: A typology and e-commerce customer relationships model}} , author={{ DMcknight } and { NormanLHarrison } and { Chervany }} , booktitle={{Proceedings of the 34th Annual Hawaii International Conference on}} the 34th Annual Hawaii International Conference on , publisher={IEEE} , year={2001. 2001} 10 , note={System Sciences} } @incollection{b12, , title={{NP-complete stable matching problems}} , author={{ EytanRonn }} , journal={{Journal of Algorithms}} 11 2 , year={1990} } @incollection{b13, , title={{Random paths to stability in two-sided matching}} , author={{ AlvinERoth } and { JohnHVande Vate }} , journal={{Econometrica: Journal of the Econometric Society}} , year={1990} } @incollection{b14, , title={{Gale-shapley stable marriage problem revisited: Strategic issues and applications}} , author={{ Chung-PiawTeo } and { JaySethuraman } and { Wee-PengTan }} , journal={{Management Science}} 47 9 , year={2001} } @incollection{b15, , title={{A computational dynamic trust model for user authorization}} , author={{ YuhuiZhong } and { BharatBhargava } and { YiLu } and { PelinAngin }} , journal={{IEEE Transactions on Dependable and Secure Computing}} 12 1 , year={2015} } @incollection{b16, , title={{College admissions and the stability of marriage}} , author={{ DavidGale } and { LloydSShapley }} , journal={{The American Mathematical Monthly}} 69 1 , year={1962} } @incollection{b17, , title={{Keeping partners together: algorithmic results for the hospitals/residents problem with couples}} , author={{ EricJMcdermid } and { DavidFManlove }} , journal={{Journal of Combinatorial Optimization}} 19 3 , year={2010} }