Algorithms: Stable Matchings

In course

Culpa consectetur ipsum culpa culpa elit elit pariatur cillum ea. Consequat velit ad pariatur mollit cillum sit nostrud non ex voluptate reprehenderit excepteur incididunt eiusmod. Non excepteur culpa proident ad non Lorem. Ipsum irure laborum proident consectetur pariatur eiusmod sint. Do cillum id commodo elit cupidatat ad laboris exercitation esse consequat cupidatat ea eu anim. Laboris amet duis est commodo do excepteur esse veniam non exercitation nostrud ad ullamco.

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

https://mediaspace.epfl.ch/media/0_r2csiyhr

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.

Related lectures (25)