Note on the size of a stable matching
Abstract
Consider a one-to-one two-sided matching market with workers on one side and single-position firms on the other, and suppose that the largest individually rational matching contains n pairs. We show that the number of workers employed and positions filled in every stable matching is bounded from below by n2 and we characterise the class of preferences that attain the bound.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.