Abstract
We consider a version of Gale and Shapley’s (1962) marriage market featuring a continuum of women and men based on Greinecker and Kah (2021). We
define a deferred acceptance algorithm for this setting and show that it terminates after a finite number of iterations to yield a side-optimal stable matching.