Matchings · Application: Stable Matching

Lesson 2

Nikolai Chukhin · Alexander S. Kulikov

Problem. In the example below, students and companies are paired as follows: \(A-E, B-G, C-H, D-F\). The current match of each student and company is highlighted in the corresponding preference list.

Is this matching stable?

This problem can only be submitted at Cogniterra.

  1. Stable

  2. Unstable