Lecture

Marriage Problem: Gale Shapley Algorithm

In course

Duis mollit adipisicing duis aute irure nisi cillum. Laborum consectetur incididunt anim adipisicing qui proident exercitation. Laboris anim laborum occaecat voluptate pariatur ut proident consequat eiusmod.

Description

This lecture covers the Marriage Problem and the Gale Shapley Algorithm, which aims to find a stable matching between two sets of individuals based on their preferences. The algorithm iteratively pairs individuals until a stable match is achieved.

Official source

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

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.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.