CS261 Winter 2018- 2019 Lecture 5

Goel, A. (2019). CS261 Winter 2018- 2019 Lecture 5: Gale-Shapley Algorithm.

Type

Unclassified

Intellectual base

Unclassified

Year

2019

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Stable matching problem
  • … between constitutive identity and a convenient observable transfers from The Gale-Shapley algorithm produces a stable marriage matching for equal sets with strict complete preferences. to A school-admissions mechanism uses deferred acceptance with capacities and priorities under its declared stability notion..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:bfc0573f1fed · see in the full table