| paper | d4-journals-geb-2023-0075 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | yes |
Proposition 2
statement extracted from the paper’s text layer
Given a finite rational distribution μ over student types t, where each type specifies a home district and strict school ranking, per-capita school capacities, and finitely represented district and school admission rules acting on type-mass vectors, compute the school-based student-optimal stable mass assignment and the district-based COP mass assignment. Determine whether, for each type, the school-based assignment mass weakly stochastically dominates the district-based assignment mass according to that type’s ranking.
An atomless student population with finite support of types \(t=(d,P)\) and rational masses \(\mu_t\); allocation variables \(x_{t,d,c}\ge 0\) assign mass to contracts, subject to per-capita school capacities and type-level mass admission rules. Each student receives one school contract, while a type’s mass may be split across contracts.
An individual student has zero mass in an atomless society, so Proposition 2’s individual strategy-proofness claim does not transfer unchanged; the student-optimal assignment and typewise welfare comparison remain meaningful.
fatal: False
The mirror covers Proposition 2’s student-optimal assignment and welfare comparison. It leaves Proposition 1’s rationalization and the policy characterizations in Theorems 1–4 as finite-agent results.
This paper has no named computational-complexity result to anchor a continuous mirror. Its numbered results concern rationalizing district admission rules, comparing matching outcomes, and characterizing policy conditions. Proposition 2 establishes properties of the cumulative offer process, but it does not classify the complexity of a problem; the paper gives no hardness, tractability, or parameterized-complexity result. The cited Theorems 1–3 are also policy and welfare results, not complexity results.
A continuous population model is plausible here: types could encode students’ preferences and home districts, mass could represent each type’s share of the student population, and the decision could be a mass assignment to schools subject to per-capita capacities and admission rules. One could ask for a student-optimal stable assignment under district-based or school-based admissions. But that would be a new computational question, not a continuous mirror of a named computational result in this paper. There are therefore no qualifying anchors, and no per-anchor problem to propose.
The proponent raises no result-specific anchors. Their central point is strong: this paper has no named computational-complexity result. Its propositions and theorems characterize admission rules, matching outcomes, and policy conditions; none asks for a complexity classification or specifies an algorithmic input. For ChoCo’s purposes, that leaves no ready-made computational problem to continuize.
The strongest candidate for a new mirror is Proposition 2: represent students by masses over home-district and preference types, scale school capacities to mass, and compute a student-optimal stable assignment under school-based admissions. That population regime is plausible for public schools, so lack of multiplicity is not a sound objection. And type-by-type welfare comparisons could remain meaningful. But strategy-proofness is harder to carry over: an individual has zero mass, so a distribution-level outcome cannot register their unilateral report; making it register requires adding an individual atom, while allowing a positive-mass cohort to misreport changes the question to coalition manipulation.
There is also already a continuum school-admissions framework in which students are distributed over types and stable assignments correspond to supply-and-demand or cutoff conditions; related work treats deferred acceptance as a price-adjustment process. That does not settle the computational complexity of Ehlers’s interdistrict contract model, so it is not a novelty collision under the programme’s rules. It does, however, make the baseline “compute a stable assignment for a continuum of students” a less distinctive contribution. The richer interdistrict extension could still be worthwhile, but it would be a new computational project rather than a mirror of a complexity result in this paper. [Azevedo and Leshno (2016)](https://www.journals.uchicago.edu/doi/pdf/10.1086/687476?download=true) [Kapur, “Characterizing Nonatomic Admissions Markets”](https://arxiv.org/abs/2107.01340)
The other tempting results fare no better as computational anchors. Proposition 1’s rationalization and the own-student, initial-matching, and capacity conditions are properties of choice rules over sets of contracts; changing student counts to masses does not by itself turn them into computational problems. To ask for complexity, one must choose a finite representation of those rules. The paper allows general choice functions with completion properties but gives no such encoding, so support size alone would not define the input or its complexity.
That is the strongest honest negative case: this paper supplies no program-ready computational anchor, and its most plausible continuous assignment problem is an added algorithmic question with substantial overlap with existing continuum admissions theory. The case is weak at the universal claim. A finite-support, multi-district version with a carefully specified representation of priorities and choice functions could be sensible and useful; nothing in the paper rules that out. I would argue against prioritizing a mirror on this paper alone, but cannot honestly establish that no worthwhile scenario exists.
The adversarial triple: the proponent anchors on up to three named results; the opponent sees that case and must defeat every anchor; the judge decides which case convinced it. These are the pipeline’s own outputs, generated by tools/triple_run.py — no human edited them. The paper’s own text is not reproduced here beyond the quoted statement above.