Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Algorithms: Stable Matchings
In course
DEMO: commodo labore
Non elit cillum reprehenderit qui proident. Reprehenderit do ea magna labore nulla deserunt tempor elit. Sint veniam nostrud deserunt amet mollit. Laboris laboris fugiat id sint laborum officia tempor deserunt. Quis culpa ex irure eiusmod quis dolore. Consectetur nostrud et irure tempor ullamco aliquip adipisicing est adipisicing.
Description
This lecture covers the concept of stable matchings, defining matchings, preferences, stability, and the Gale-Shapley algorithm for constructing a stable maximum matching for the marriage problem.
Official source
About this result
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.