Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGupta, Ekta-
dc.contributor.authorNitin [Guided by]-
dc.description.abstract1.1 Stable Matching Problem The Stable matching problem was first introduced by David Gale and Lloyd Shapely in 1962 in a paper entitled “College Admission and the Stability of Marriage” [1]. Gale and Shapely analysed the matching at abstract and general level where they used marriage problem as an illustrative example. Idea behind the marriage problem was “How matching should be done between set of men and set of women with their respective preference list?” The main challenge behind the simple idea was that matching should be done in such a way that no pair should break up and form new pair which would make them better off. For such idea, the solution was “Gale Shapely – deferred acceptance algorithm” consisting of set of simple rule and solvable in polynomial time.en_US
dc.publisherJaypee University of Information Technology, Solan, H.P.en_US
dc.subjectStable matchingen_US
dc.subjectNetwork designen_US
dc.subjectEdge connectivityen_US
dc.subjectPreserving basic propertyen_US
dc.titleStable Matching Problem and Its Approach to Determine Vital Link in 2-way Networken_US
dc.typeProject Reporten_US
Appears in Collections:Dissertations (M.Tech.)

Files in This Item:
File Description SizeFormat 
Stable Matching Problem and Its Approach to Determine Vital Link in 2-way Network.pdf608.99 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.