{"paper":{"title":"Finalizing tentative matches from truncated preference lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.GT","authors_text":"Hisao Tamaki","submitted_at":"2016-05-14T05:14:45Z","abstract_excerpt":"Consider the standard hospitals/residents problem, or the two-sided many-to-one stable matching problem, and assume that the true preference lists of both sides are complete and strict. The lists actually submitted, however, are truncated. Let I be such a truncated instance. When we apply the resident-proposing deferred acceptance algorithm of Gale and Shapley to I, the algorithm produces a set of tentative matches (resident-hospital pairs). We say that a tentative match in this set is finalizable in I if it is in the resident-optimal stable matching for every completion of I (a complete insta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04381","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}