| paper | d4-journals-jet-2018-0059 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | yes |
Theorem 2
statement extracted from the paper’s text layer
Given a finite set of types with rational masses \(\mu_t\u005c), school preferences, priority tiers, capacities \(\kappa_c\u005c), and category floors and ceilings \(\ell_{gc},u_{gc}\u005c), with schools agreeing on the same bottom priority-mass segments required by the mass analogue of B-common priority, find a feasible assignment \(x_{tc})\u005c) if one exists. Feasibility requires \(\sum_c x_{tc}=\mu_t\u005c), \(\sum_t x_{tc}\leq\kappa_c\u005c), and \(\ell_{gc}\leq\sum_{t:g(t)=g}x_{tc}\leq u_{gc}\u005c); stability means no positive feasible mass move into a preferred school can either use an available slot or displace lower-priority mass there.
A society is a distribution \(\mu\u005c) over finitely many complete types, each specifying a quota category, school preference order, and priority tier at every school. The decision variable is the mass assignment \(x_{tc}\u005c); the task is to find a feasible stable assignment, with no welfare objective.
Priority tiers remove within-tier inversions, and mass blocking replaces the paper’s tests involving named students; the proponent bounds the proposal to tier-based markets but cannot show that the original authors would accept this changed fairness notion.
fatal: False
The mirror covers the stable-assignment existence question in Theorem 2. It leaves Theorem 3’s atomic flexibility boundary, the Pareto comparisons, and DAPL’s incentive properties without a continuous analogue.
The strongest mirror is the paper’s stable-assignment existence boundary. There are no named worst-case complexity results here—nothing classifies a problem as polynomial-time, NP-hard, or parameterized. The paper does have a constructive mechanism, DAPL, but its stated guarantees are about existence and mechanism properties, not running time. So I would treat the mirrors below as new computational questions prompted by the paper, not as complexity results it already proves.
A plausible high-multiplicity setting is a large centralized school match with many applicants but relatively few combinations of submitted preference list, quota category, and coarse school-priority tier. For example, \(n\) might be in the hundreds of thousands while the number \(\tau\) of such combinations is far smaller. Let each full type \(t\) have mass \(\mu_t\), a quota category \(g(t)\), a school preference order \(P_t\), and a priority tier at each school. Members of a type are interchangeable in all these respects. The quota category remains separate from the full type because applicants with different preferences or priority tiers can count toward the same school quota.
For schools \(C\), use mass capacities \(\kappa_c\) and category floors and ceilings \(\ell_{gc},u_{gc}\). The decision is an assignment matrix \(x_{tc}\geq 0\), with \(\sum_c x_{tc}=\mu_t\), \(\sum_t x_{tc}\leq\kappa_c\), and \(\ell_{gc}\leq\sum_{t:g(t)=g}x_{tc}\leq u_{gc}\). A mass assignment is non-wasteful if no positive amount of a type can be moved from a less preferred school to a more preferred one while preserving feasibility. It is fair if no positive amount can be exchanged to give a type a school it prefers over its current assignment while displacing a lower-priority type, with the exchange feasible under the quotas. Thus the solution is a feasible, stable mass assignment; there is no welfare objective in the paper to preserve.
The co-modification is that schools rank priority *tiers*, with members of a tier tied. That makes repeated types possible while retaining meaningful priority differences across types. The paper’s \(B\)-common condition then has a mass version: for each quota category, schools must agree on the same bottom segment of priority mass, with the segment size determined by the maximum binding quota mass in the other schools.
My lead is Continuous Stable Assignment under Bottom-Mass Common Priority, anchored in Theorem 2, proved in this paper. The theorem says that for every problem with \(B\)-common priority, there exists a feasible assignment that is fair and non-wasteful. The continuous question is: given rational type masses, capacities, category floors and ceilings, preferences, and priorities satisfying bottom-mass common priority, find a stable mass assignment \(x\). The theorem does not establish a running-time bound, but its proof constructs an assignment through DAPL. I would expect this search problem to be tractable, plausibly in Class A: the support is finite, and the paper’s constructive argument suggests a mass-based version of deferred acceptance or a flow procedure. Whether that can be made polynomial in \(m,\tau,L\) is exactly the new question.
The second mirror is Continuous Priority-Boundary Witness, anchored in Theorem 3, also proved here. In full, Theorem 3 says that for a primitive problem satisfying Assumption 1, any pair of schools’ rankings over one type that fails pairwise \(B\)-common priority admits student preferences and a complete school-priority profile such that: the chosen pair has the specified rankings; every other pair involving either school has common priority for that type; every pair of schools has common priority for every other type; and there is no feasible, fair, non-wasteful assignment. The continuous problem is: given a rational, mass-flexible quota system and a pair of school priority orders that disagree on the relevant bottom mass, determine whether there is a preference profile and a completion of the other priorities meeting those same restrictions for which no stable mass assignment exists. A positive answer should provide the preferences and a certificate that no feasible stable \(x\) exists; a negative answer should establish that fractional assignment avoids the obstruction.
I would treat that boundary question provisionally as Class C: the key issue is whether splitting positive mass repairs the finite cycle of justified envy, and that depends on the continuous model itself. I expect some priority inversions across positive-mass blocks to preserve the paper’s nonexistence construction, but I would not claim that every finite violation remains fatal. The theorem is a structural existence result, not a hardness-transfer theorem.
Together, these questions cover the paper’s stability existence results, not its Pareto comparisons, strategy-proofness claims, or all properties of DAPL. They also suggest follow-up work: whether mass-DAPL inherits feasibility and non-wastefulness; whether the pairwise bottom-mass condition is necessary in the continuous model; and how rational mass solutions translate to discrete assignments by replication or rounding.
The weak point is the priority model. The paper ranks named students strictly. If exact individual tie-breaks matter, encoding each applicant’s rank in their type can make \(\tau\) nearly \(n\), eliminating the high-multiplicity regime. Coarse priority tiers are plausible in policy settings, but they change the treatment of within-tier envy. The paper’s own student-supervisor example is also small. So this is a credible mirror for large markets that treat priority bands as the operative policy; it is not a faithful high-multiplicity account of every instance covered by the paper.
The strongest objection to both mirrors is that the paper’s stability notion depends on distinctions that prevent the high-multiplicity grouping the programme needs. Each school has a strict priority ranking of named students. If two students are the same type in the programme’s sense, they must be indistinguishable to every school; but a strict ranking distinguishes every pair. Include students’ priority positions in their types and, in general, the support grows with the number of students. Omit those positions and the grouping forgets information the paper’s fairness tests use.
Priority tiers are the best repair. A large school district might have many applicants in a few preference and priority bands. But tiers replace strict priorities with ties. That changes which envies count and removes within-tier inversions—the very variation the paper’s \(B\)-common priority condition controls. Refining each tie to recover the paper’s strict order restores the individual distinctions and loses the mass types again. This is a serious mismatch, though not a conclusive one: the authors might recognize a tier-based version as a natural extension of their problem.
For Theorem 2, the tier-based question is coherent: does bottom-mass common priority guarantee a stable fractional assignment? But its stability notion needs more than replacing student counts by masses. In the paper, fairness asks whether a particular student can replace another while everyone else stays put, subject to feasibility. In a nonatomic population, one individual has zero mass. A blocking test based on positive mass can miss individual envy; a test allowing arbitrarily small mass moves becomes a different, fractional stability notion. Either might be defensible, but the theorem’s existence guarantee no longer identifies which one the authors would mean. The resulting question is about stability of tiered, fractional assignments, not a direct continuization of their stated result.
Theorem 3 is a weaker anchor still. Its flexibility assumption explicitly permits moving one student, with at most one other student affected, while leaving the rest of the assignment fixed. Its witness then relies on a finite cycle of indivisible assignments. A mass analogue would need a new flexibility condition about feasible infinitesimal transfers and a new version of the witness. The issue is not whether splitting mass would eliminate the obstruction; that would be an answer to the proposed question. The issue is that the paper does not supply a natural translation of the assumption and conclusion that preserves what its theorem characterizes.
There is a tempting better alternative: give each applicant a score in a small fixed set of priority bands, retain a finite set of preference types, and study fractional stability with quota-category constraints. That could be a sensible research question. But it studies a model in which priority is coarse by design, and a result about its mass stability would not classify the paper’s boundary for strict individual priorities. The other alternative—retain exact priority positions as types—makes the support too large for the intended high-multiplicity regime.
So the negative case is substantial against these two anchors as *mirrors of this paper*, especially against Theorem 3. It is not airtight against a tier-based extension. If the authors accept ties and fractional blocking as their problem, Theorem 2 could survive; the evidence here does not justify claiming that no worthwhile mirror exists in any scenario.
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.