| paper | d4-journals-geb-2018-0075 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorem 4.6 characterizes ULS axiomatically, and Proposition 4.3 gives a Shapley-value formula without a computational claim. The proponent identifies no named computational result, so no anchor satisfies the computational requirement for a continuous mirror.
fails bit a — no named computational result to mirror
The paper characterizes UES, ULS, and DES and gives Shapley-value representations; none is presented as a computational result.
The strongest honest positive case is only a lead for a future computational paper. This paper has no named computational-complexity result: none of its theorems classifies a problem as tractable or hard, or gives an algorithm with a complexity guarantee.
The nearest result is Theorem 4.6, proved here. It says the Upstream Limited Sharing (ULS) method is the unique cost-allocation method for polluted-river problems satisfying efficiency, additivity, the inessential-agent property, the necessary-agent property, weak structural monotonicity, and participation fairness. Theorem 3.5 and Theorem 3.7 similarly characterize UES; Theorem 5.4 characterizes DES. These are axiomatic characterizations, not results about computing the allocations. Proposition 4.3 gives a Shapley-value formula for ULS, but does not analyze its computational complexity.
A plausible high-multiplicity setting might involve many similar catchments, with authorities grouped by their river-network role and identical costs and responsibilities. But turning that into a continuous model would require specifying how mass preserves the network relationships and defining the corresponding allocation problem. The paper supplies neither, and its theorems do not anchor a computational question about that extension.
So I cannot state a per-anchor continuous problem, or predict whether its complexity would be tractable, transfer hardness, or become continuum-specifically hard, without inventing a new problem for the authors. That is the limit of the positive case here.
The strongest case against is that this paper supplies no named computational result to continuize. Theorem 4.6 characterizes ULS by axioms; Theorems 3.5 and 3.7 do the same for UES, and Theorem 5.4 for DES. None poses a computation problem or gives a complexity guarantee. Proposition 4.3 gives ULS as a Shapley-value sum over coalitions, but does not analyze how to compute it. So the proponent’s proposed anchor is accurately identified, and it does not survive as a computational result to mirror.
The best rescue would be a high-multiplicity ULS problem: many equivalent tributary jurisdictions, grouped by their cost and exact role in the river network, with a question about computing each group’s aggregate allocation. That is more plausible than a continuum of arbitrary river locations. Repeated identical tributaries could form sensible types. But independent copies of a catchment just repeat the same allocation; their aggregate is a rescaling. In a shared network, type masses alone do not specify the permission relationships: the model must also supply the graph and how each type connects to others. In a fixed graph, repeated vertices can be grouped, but a continuum limit would require a new permission-value model and a new computational question. The paper does not formulate either.
A continuum over locations has a related difficulty. These methods use vertices with individual costs and permissions, and their axioms examine events such as removing an arc or a player’s costs being the only nonzero ones. In an atomless population, a single location has zero mass; preserving the effect of an arc cut requires retaining additional topological structure. A hybrid model with that structure may be worth studying, but it would be a new model built around the paper’s setting, not a continuous version of one of its results.
So the negative case is strong for this paper’s value as a ChoCo mirror: every named anchor is axiomatic, and the plausible high-multiplicity variants lead to questions the authors did not pose. The universal claim is weaker. Repeated, structurally identical tributaries are a credible setting, and Proposition 4.3 could motivate a computational study there. That possibility does not furnish a continuous computational result from this paper to mirror.
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.