Gale-Shapley Algorithm
The Gale-Shapley algorithm solves the stable marriage problem: how to match two groups (e.g., medical residents to hospitals, students to schools) such that no pair prefers each other to their assigned partners. Introduced by David Gale and Lloyd Shapley in 1962, the algorithm guarantees a stable matching in polynomial time through a deferred acceptance process where one side proposes sequentially and the other side responds, revising choices as better options arrive.
Allikakirje
Tsiteeringud kopeeritud meetodi allikakirjest sõna-sõnalt. Nendest ei saa järeldada väidete tasemel kinnitust.
- Gale, D., & Shapley, L. S. (1962). College admissions and the stability of marriage. The American Mathematical Monthly, 69(1), 9-15. · DOI 10.1080/00029890.1962.11989827
- Roth, A. E. (1984). The economics of matching: Stability and incentives. Mathematics of Operations Research, 7(4), 617-628. · DOI 10.1287/moor.7.4.617
Kureeritud väited
Väited on salvestatud tõendite registrisse, igal oma hinnanguga.
See vaade ei loo väite hinnangut, kui registris seda pole.
Seotud meetodid
Genereeritud meetodigraafist ja kuvatud masina soovitatud seostena – väiteid ei järeldata.