| paper | d4-journals-mss-2002-0037 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
Theorem 17 is an axiomatic uniqueness characterization, and no numbered result asserts an algorithm, runtime, or computational hardness, so bit (a) fails. Computing cohort charges is a plausible new problem, but it does not mirror a computational result proved here and would require a finite representation of the cost functional and paths.
fails bit a — no named computational result to mirror
No paper result receives a computational mirror; the cohort-charge proposal would cover only the Path Serial allocation formula, while the numbered results concern axiomatic properties, incompatibility, and characterization.
There is no qualifying computational anchor in this paper. Its numbered results do not classify a problem as polynomial-time solvable, hard, fixed-parameter tractable, or otherwise computationally tractable or intractable. The closest is Theorem 17, proved here: the Path Serial Rule is the unique cost-sharing rule satisfying Equal Treatment of Equivalents and the Path Serial Principle. That is an axiomatic characterization, not a computational result. The paper defines a formula for the rule, but gives no input representation or running-time claim from which to anchor a complexity mirror.
A plausible population setting would be a large municipality sharing infrastructure costs: types are resident cohorts with the same multicommodity demands, stand-alone costs, and demand-scaling paths; \(\mu_t\) is each cohort’s population share. One could ask for the per-capita charges under a mass version of the Path Serial Rule, with each incremental cost divided among the mass of cohorts still above the relevant stand-alone-cost threshold. Given rational type masses and an explicitly represented cost functional and paths, the output would be the type-level charge vector, budget balanced by \(\sum_t \mu_t x_t=C\). This is a plausible extension of the paper’s cost-sharing problem, and its natural-gas example gives the authors a reason to recognize the setting.
But that would be a new computational question, not a mirror anchored in a named computational result of this paper. Its demands and commodities are already continuous; making the population continuous could be meaningful, but the paper does not study the resulting algorithmic landscape. So the strongest honest positive case is that a credible population extension can be formulated—not that this paper supplies a qualifying ChoCo anchor.
The strongest negative case is that the proposed mirror has no computational result in the paper to mirror. Theorem 17 characterizes the Path Serial Rule through Equal Treatment of Equivalents and the Path Serial Principle. The other numbered results establish properties of the rule or incompatibilities among axioms. None studies an algorithmic problem or makes a complexity claim.
The municipality example is a credible high-multiplicity setting: cohorts with the same demands and paths could be treated as types, and the natural-gas example gives the authors a reason to recognize that model. But computing cohort charges would be a new problem, not a continuous version of Theorem 17. The paper allows arbitrary cost functions and scaling paths without specifying finite encodings, so its model does not define a computational complexity question. If those functions are given in a tractable explicit form, a mass version appears to reduce to sorting types, finding threshold points along their paths, and evaluating costs. If the encoding makes those steps hard, the difficulty comes from the added representation or cost model, not from a computational result in this paper.
A stronger analogue of Theorem 17 could characterize a mass-based rule. But that would continuize an axiomatic question, which the programme explicitly puts out of scope. So the proponent shows that a population extension is plausible, not that this paper offers a worthwhile computational mirror. The negative case is strong on that distinction; it is weaker as the universal claim that no useful computational project could be built from the setting.
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.