Gale–Shapley algorithm

Target entity: Gale–Shapley algorithm
Context triple: [David Gale, notableWork, Gale–Shapley algorithm]

• A. Matchmakers
  Matchmakers is a popular Ukrainian comedy television series produced by Kvartal 95 Studio that follows the humorous clashes and relationships between two very different families.
• B. Sperner's lemma
  Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
• C. Happy Ending problem
  The Happy Ending problem is a famous combinatorial geometry question that investigates the minimum number of points in general position in the plane needed to guarantee the existence of a convex polygon with a given number of vertices.
• D. Erdős–Gallai theorem
  The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
• E. Eppstein
  Eppstein is a small historic town in the German state of Hesse, known for its medieval castle and scenic location in the Taunus mountains.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Gale–Shapley algorithm
Target entity description: The Gale–Shapley algorithm is a foundational procedure in mathematics and computer science that computes stable matchings between two equally sized sets, such as students and schools or men and women in the stable marriage problem.

• A. Matchmakers
  Matchmakers is a popular Ukrainian comedy television series produced by Kvartal 95 Studio that follows the humorous clashes and relationships between two very different families.
• B. Sperner's lemma
  Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
• C. Happy Ending problem
  The Happy Ending problem is a famous combinatorial geometry question that investigates the minimum number of points in general position in the plane needed to guarantee the existence of a convex polygon with a given number of vertices.
• D. Erdős–Gallai theorem
  The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
• E. Eppstein
  Eppstein is a small historic town in the German state of Hesse, known for its medieval castle and scenic location in the Taunus mountains.
• F. None of above. chosen