This lecture covers the concept of stable matchings, defining matchings, preferences, stability, the marriage problem, and the Gale-Shapley algorithm for constructing a stable maximum matching.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ad elit labore laboris ex cillum aliqua do voluptate. Adipisicing velit aute consectetur incididunt elit fugiat aliqua. Mollit nulla eiusmod irure eu consequat proident culpa ipsum dolore est excepteur nostrud ex.
