On the set of stable matchings of a bipartite graph

preprint2023arXivOpen access

Abstract

The topic of stable matchings (marriages) in a bipartite graph has become widely popular, starting with the appearance of the classical work by Gale and Shapley. We give a detailed survey on selected known results in this field that demonstrate structural, polyhedral and algorithmic properties of such matchings and their sets, providing our description with relatively short proofs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.