Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings
Published Online:24 Jan 2022https://doi.org/10.1287/opre.2021.2199
- Cited by
- 30 October 2025 | Mathematical Programming, Vol. 216, No. 1-2
- 22 September 2022 | Kybernetes, Vol. 52, No. 12
Volume 70, Issue 3
May-June 2022
Pages iii-viii, 1293-1952, C2-C3
Article Information
Supplemental Material
Metrics
Information
- Received:October 24, 2018
- Accepted:August 11, 2021
- Published Online:January 24, 2022
Copyright © 2022, INFORMS
Cite as
Yuri Faenza, Xuan Zhang (2022) Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings. Operations Research 70(3):1873-1890.
https://doi.org/10.1287/opre.2021.2199
Keywords
