| paper | d4-journals-geb-2022-0029 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Corollary 2 gives an explicit construction for computing lattice operations on rational lotteries, so it is a computational anchor despite lacking a runtime bound. But the proponent declines to formulate a continuous problem for that result; the proposed type-mass market is only a setting for a possible new question. The opponent's point that such a model needs a new type-level account of blocking reinforces that no author-recognizable mirror is stated here.
fails bit b-changes — the continuum limit changes the question
No result is covered by a surviving continuous mirror. Corollary 2 is the closest computational result; Theorem 2 establishes the lattice structure, while the other results develop its representations, order, and operations for finite markets.
I cannot make a valid positive case under the anchor requirement: this paper has no numbered computational-complexity result asserting that a problem is in P, hard, FPT, or otherwise classified.
The closest candidate is Corollary 2, proved here: for rational random stable matchings, it gives a common-denominator construction for computing joins and meets by applying the deterministic matching operations term by term. But it makes no runtime or complexity claim; the denominator expansion may itself be large. Theorem 2, also proved here, establishes that the random stable set forms dual lattices. That is a structural theorem, not a computational result.
A many-to-many market with many interchangeable firms and workers grouped by complete preference types could motivate a continuous-population matching question. But the paper’s randomization is over whole stable matchings: it continuizes outcomes, while keeping the market finite. Turning its results into a question about masses of agent types would require an additional model and would not mirror a named computational result of this paper. The strongest honest positive conclusion is therefore that the paper offers a possible *setting* for a new high-multiplicity question, but no qualifying anchor on which to base the requested mirror.
The strongest case against a ChoCo mirror is that the paper has no numbered result classifying the complexity of a computational problem. Theorem 2 proves a lattice structure; Proposition 5 identifies its join and meet operations; Corollary 2 gives a construction for computing those operations on rational random stable matchings. The corollary is the closest anchor, but it states no running time or complexity bound. Its construction also takes the random matchings as input; it does not address finding stable matchings or optimizing over them. The lattice theorem is structural, not computational. So neither survives as the computational result the programme is meant to continuize.
The best proposed setting would group many firms and workers into complete preference types, give each type a rational population mass, and study stable flows between types—perhaps asking how to compute a stable flow or its lattice operations. That is a plausible high-multiplicity matching problem. But it supplies a new computational question, not a mirror of a computational result in this paper. The paper’s matching and blocking conditions concern individually named agents; a mass model needs a type-level account of blocking. Such a model may be a good research direction, but its definition and computational target would have to come from elsewhere. The lotteries in this paper do make outcomes fractional, while leaving the market finite; I do not count that as either a population continuization or a novelty collision.
So the negative case is strong against a ChoCo mirror *of this paper*: its named results offer no computational-complexity anchor, and the more ambitious type-mass proposal is a new problem rather than a continuization of one. The universal claim is weaker: I cannot honestly say that every continuous-population matching problem suggested by this setting would be uninteresting on its own.
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.