Merge Signatory Acceptance with airSlate SignNow

Merge signatory acceptance

all right so in this episode i'm going to talk about a very powerful theorem uh which is first proposed by uh gail and chapley in 1962 and the theorem is the following there always exists as stable matching in any one-on-one matching market all right so uh for any preference relation you give me if it is a finite remember one to one matching market well then i will always get you a stable matching well how am i gonna get you the stable matching uh well the the gail and shapley also proposes an algorithm to get this stable matching well it's called deferred acceptance algorithm or da because there are two sides in the one-to-one matching student side college site there are actually two kinds of deferred acceptance algorithm student proposing deferred acceptance and college proposing deferred acceptance all right well here it is the i mean this version is the student proposing deferred acceptance algorithm all right uh let me read it through and then i'll sort of work on this example and then talk about what it would mean a college proposing deferred acceptance so the the d.a method or the da algorithm the student proposing different acceptance algorithm works in finite steps in the first step in the very first step each student applies to his or her first choice first best college only okay all right well then each college tentatively holds the most preferred student if there are multiple applicants if there's no applicant obviously this college is not going to do anything but if there are multiple applicants the students the most preferred students will be admitted but tentatively and then all the other students will be rejected all right and once a student is rejected while then those students are not allowed to reapply okay well in step two or in any other step t greater than or equal to two it repeats itself all right so i call it step t each student rejected in the previous step step t minus one applies to the next best all right so you're not allowed to apply again to the same college because you're rejected that means you're going to apply to your next best well then after receiving the uh you know applications each college is going to consider the new applicants there might be more than one new applicants and the student who has been tentatively accepted in stage t minus one uh maybe no one admitted tentatively but may probably one student has been admitted tentatively so the college is going to think about that student plus the new applicant out of all those candidates the college is going to accept the best student and reject everybody else all right and then uh basically it repeats itself um so this uh this this algorithm this process will terminate uh when there is no more applications by the students all right obviously and it will terminate in a finite...