Deferred acceptance with compensation chains

Piotr Dworczak*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

I introduce a class of algorithms called Deferred Acceptance with Compensation Chains (DACC). DACC algorithms generalize the DA algorithms by Gale and Shapley [1962] 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.

Original languageEnglish (US)
Title of host publicationEC 2016 - Proceedings of the 2016 ACM Conference on Economics and Computation
PublisherAssociation for Computing Machinery, Inc
Pages65-66
Number of pages2
ISBN (Electronic)9781450339360
DOIs
StatePublished - Jul 21 2016
Event17th ACM Conference on Economics and Computation, EC 2016 - Maastricht, Netherlands
Duration: Jul 24 2016Jul 28 2016

Publication series

NameEC 2016 - Proceedings of the 2016 ACM Conference on Economics and Computation

Other

Other17th ACM Conference on Economics and Computation, EC 2016
CountryNetherlands
CityMaastricht
Period7/24/167/28/16

Keywords

  • Gale-Shapley algorithm
  • Matching
  • Stability

ASJC Scopus subject areas

  • Statistics and Probability
  • Computer Science (miscellaneous)
  • Economics and Econometrics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Deferred acceptance with compensation chains'. Together they form a unique fingerprint.

Cite this