| paper | d4-journals-geb-2019-0080 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
The paper's numbered results establish comparative-statics inequalities and lattice properties, not an algorithm, complexity bound, hardness result, or solver formulation used to compute. A continuous cohort model yields a recognizable analytical extension of Theorem 3.1 and Theorem 4.1, but it cannot supply the missing computational anchor, so the mirror fails bit (a).
fails bit a — no named computational result to mirror
The proposed extension targets Theorem 3.1 and its competitive-equilibrium analogue, Theorem 4.1; it does not provide a computational mirror of the supporting lemmas, corollaries, lattice results, or other static claims.
The honest answer is that this paper has no named computational result of the required kind. It states no problem is in P, NP-hard, FPT, or otherwise classifies its computational complexity. Its named results concern existence, lattice structure, and comparative statics. The paper mentions algorithms for obtaining some extreme allocations, but those are attributed to other work; it gives no running-time result of its own. So there is no qualifying anchor for a ChoCo computational mirror.
The closest result to build on is Theorem 3.1, proved here. It compares firm-optimal or worker-optimal stable allocations before and after entry. When firms enter, align the old and new individual-payoff vectors for incumbents so they preserve essential partnerships; then, regardless of how the other partnerships are ordered, each incumbent firm’s old vector is componentwise at least its new vector, while each worker’s new vector is componentwise at least their old vector. Part (b) gives the reverse pattern when workers enter: incumbent firms’ new vectors are at least their old vectors, and incumbent workers’ old vectors are at least their new vectors. Theorem 4.1, also proved here, gives the analogous result for buyer-optimal or seller-optimal competitive-equilibrium allocations. These are natural bridges to a population model, but neither is a computational anchor.
A plausible continuous-population extension would model a large labor market of standardized cohorts. A firm type specifies its quota and productivity against every worker type; a worker type specifies its quota and productivity against every firm type. Let each type have a mass, and let entry add mass to one or more firm types. A matching is then a measurable assignment of individual agents, with integral quotas for each agent and fractional aggregate flows between types. Payoffs remain attached to individual partnerships and must satisfy the paper’s stability condition. The candidate question is whether the componentwise comparisons in Theorem 3.1 hold for almost every incumbent under firm-optimal or worker-optimal stable allocations, when incumbents’ essential partnerships are aligned. This is a credible high-multiplicity scenario if many firms and workers share a modest number of complete types; it also preserves the paper’s focus on entry and individual payoffs. I would expect the comparative-statics inequalities to be the right conjecture, though existence and ordering of extreme stable outcomes in this setting would need careful treatment.
That candidate would be an analytical extension, not the computational question the programme targets. The paper neither asks for an algorithm to compute these outcomes from a type-mass input nor establishes complexity for a finite-agent problem that a continuous algorithm could relax. The A/B/C trichotomy therefore does not apply, and calling this a computational mirror would overstate the case. The weakest point is decisive: the proposed continuum model fits the paper’s economics, but the paper supplies no computational anchor for ChoCo.
The strongest case against a ChoCo mirror is that the paper has no named computational result to continue. Theorem 3.1 and Theorem 4.1 are named, substantial results, but they establish comparative-statics inequalities; they do not classify the complexity of a problem or analyze an algorithm’s running time. The algorithms mentioned are attributed to earlier work, and this paper makes no complexity claim about them.
The proposed mirror of Theorem 3.1—whether almost every incumbent’s payoff vector obeys the same ordering after a mass of firm types enters—keeps the economics but remains an analytical comparative-statics question. The original theorem compares individual vectors after preserving incumbents’ essential partnerships. A type distribution alone records masses and characteristics, not which partnerships are preserved across the two markets. One can supply an identity-preserving coupling, or replace individual vectors with distributions over payoff vectors. Those are reasonable modelling choices, but either makes the result a new continuum theorem about comparative statics, not a computational question posed by this paper.
A stronger computational proposal would ask for the firm-optimal or worker-optimal stable outcomes, or for the entry-response map, given rational type masses. That is well-posed and could be useful. But it changes the target: it asks how to compute outcomes, whereas the paper asks how those outcomes compare when agents enter. The same distinction defeats Theorem 4.1. Its competitive-equilibrium version supplies another comparative-statics statement, not an independent computational anchor; computing prices and allocations in a type-mass market would again be a separate algorithmic project.
The high-multiplicity scenario itself is credible: standardized cohorts of firms and workers can have common quotas and productivity profiles. I would not reject the mirror on the ground that such cohorts are implausible, or because the continuous answer might be easy. The narrower negative case is that the paper gives ChoCo no computational result to mirror; its proposed continuizations preserve its subject matter but not the programme’s computational question. That case is weaker as a claim that *no* worthwhile project could arise: a broader programme on algorithms for high-multiplicity matching markets could be valuable. It would, however, be an extension beyond this paper’s results.
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.