Deferred Acceptance with Compensation Chains
Piotr Dworczak ()
Operations Research, 2021, vol. 69, issue 2, 456-468
I introduce a class of algorithms called deferred acceptance with compensation chains (DACC). DACC algorithms generalize the Gale–Shapley algorithm by allowing both sides of the market to make offers. The main result is a characterization of the set of stable matchings: a matching is stable if and only if it is the outcome of a DACC algorithm. The proof of convergence of DACC algorithms uses a novel technique based on a construction of a potential function.
Keywords: matching; stability; deferred acceptance; compensation chains (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2) Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:69:y:2021:i:2:p:456-468
Access Statistics for this article
More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Matthew Walls ().