Metraipolis › archive › dc_7f06172e2f31

A Reachable-State Operator Formulation of Deferred Acceptance: Progress Invariants and Structural Diagnostics — arXiv:2609.19237

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.19237
License (as archived)
CC0-1.0
Archived
2026-10-10T04:47:31.317Z
SHA-256 of the archived text
f879c0f461a689924504bc62db63e991fbe1b13d132ab276acd407d2ab7a8a6f
Stable URL of this page
https://metraipolis.com/documento/dc_7f06172e2f31

How to cite

A Reachable-State Operator Formulation of Deferred Acceptance: Progress Invariants and Structural Diagnostics — arXiv:2609.19237 — arXiv (en), https://arxiv.org/abs/2609.19237 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7f06172e2f31 (Metraipolis archive dc_7f06172e2f31, sha256 f879c0f461a689924504bc62db63e991fbe1b13d132ab276acd407d2ab7a8a6f)
BibTeX
@misc{dc7f06172e2f31,
  title = {A Reachable-State Operator Formulation of Deferred Acceptance: Progress Invariants and Structural Diagnostics — arXiv:2609.19237},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.19237},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7f06172e2f31; sha256 f879c0f461a689924504bc62db63e991fbe1b13d132ab276acd407d2ab7a8a6f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19237. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We give a reachable-state operator formulation of one-to-one deferred acceptance with strict, possibly incomplete preference lists. A local update operator is defined for each active proposer, while a scheduler selects which local update is applied. On the states reachable from the canonical empty initial state, three invariants are immediate: the set of proposed edges grows strictly, every proposer visits each acceptable receiver at most once, and every receiver holds its most-preferred proposal received so far. These invariants yield termination after at most |E| proposals and stability of every terminal reachable state. The classical rejection lemma then gives proposer optimality and schedule independence. We separate these trajectory statements from two logically different results: the distributive-lattice structure of the full stable-matching set and one-sided strategy-proofness. A diagnostic table records which proof obligation is lost when a model changes the bipartition, ordinal comparisons, proposal irreversibility, or receiver choice rule. The paper makes no new complexity claim; its purpose is a precise operator-level account of the classical proof architecture and of the limits of that architecture.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.19237 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T04:15:33.166Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).