| paper | d4-journals-geb-2022-0090 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Neither named result asserts an algorithm, a complexity bound, or hardness; both are axiomatic characterizations. The conclusion’s suggestion that the axioms may reduce computation time is not a named computational result. The continuous Shapley calculation is a plausible follow-on, but it adds a mass-based worth function and scaling model rather than mirroring a computational result established in this paper.
fails bit a — no named computational result to mirror
The proposed mass-based Shapley calculation relates to the paper’s informal discussion of computational motivation, but mirrors none of its named results; Theorem 3.9 and Corollary 3.14 are axiomatic.
The strongest positive case is a plausible research lead, not a result-backed mirror. The paper contains no named computational result asserting polynomial-time solvability, hardness, or a parameterized complexity classification.
The closest named results are Theorem 3.9, proved in this paper, which says the Shapley value is the unique TU-value satisfying efficiency, the disjointly productive players axiom, and the merged disjointly productive players game property; and Corollary 3.14, also proved here, which says it is the unique TU-value satisfying the dummy coalition axiom and the merged game property. Both are axiomatizations, not computational results. The conclusion says that these properties *may* reduce computation time, but gives no named algorithm, complexity bound, or hardness result to anchor a continuous mirror.
A reasonable lead to investigate is continuous Shapley allocation for a high-multiplicity cooperative game. Imagine a large platform or cooperative with many interchangeable contributors in a small number \(\tau\) of role-and-contract types. A type specifies everything relevant to coalition worth; a society is a rational mass vector \(\mu\) over those types, with far more contributors than types. Let \(W(x)\) give the coalition worth for each coalition mass vector \(x\in[0,\mu]\), and represent \(W\) by a rational arithmetic circuit. The question would be: given \((T,\mu,W)\), compute the exact per-member allocation for each type,
\[
\phi_t=\int_0^1 \frac{\partial W}{\partial x_t}(s\mu)\,ds.
\]
This is the limiting Shapley payoff in an anonymous repeated-player game with extensive worth \(nW(x)\), under suitable differentiability conditions. Its solution is the vector \((\phi_t)_{t\in T}\). If types \(t\) and \(u\) have no cross-effect—\(\partial^2 W/\partial x_t\partial x_u=0\) throughout the domain—then \(\phi_t\) does not depend on the mass of type \(u\), echoing the paper’s disjoint-productivity motivation. The paper’s authors could plausibly recognize this as a continuous version of their *computational motivation* for Shapley values.
For an explicitly listed sparse polynomial \(W\), the integral suggests a tractable case. With succinct circuit input, the complexity of exact integration is a separate question; the paper supplies no basis for predicting its answer. Further questions include when this limit agrees with discrete Shapley values, which representations of \(W\) admit efficient computation, and whether disjoint types can be removed or merged without changing other types’ allocations.
The weak point is decisive: this candidate mirrors the paper’s informal discussion of computation, not any named computational anchor. It also requires a model of coalition worth over type masses that the paper never defines. The paper’s formal contribution is axiomatic, and a continuous axiomatization would be outside the programme’s computational scope. So under the requested anchor rule, there is no qualifying result and no honest per-anchor continuous problem to state; the continuous Shapley computation above is only a plausible follow-on question.
The strongest objection is that the paper has no computational result to continuize. Theorem 3.9 and Corollary 3.14 characterize the Shapley value through axioms; neither states an algorithm, running time, or hardness result. The conclusion only suggests that disjointly productive players *may* help reduce computation time. A continuous version of either theorem would be an axiomatic question, outside ChoCo’s computational scope. That leaves no named computational anchor in the paper.
The best salvage is a high-multiplicity cooperative game: many interchangeable contributors in a few complete types, with coalition worth described by a function \(W\) of type masses. Under an extensive scaling such as \(v_n(S)=nW(\text{composition}(S)/n)\), a per-member Shapley payoff can converge to \(\int_0^1 \partial_t W(s\mu)\,ds\). That is a coherent follow-on, but it adds anonymity, a scaling rule, and a smooth worth function to a paper about arbitrary finite TU games. Its axioms also change in the limit: removing one atomless individual leaves the mass distribution unchanged, so the paper’s removal axiom becomes automatic. Removing a whole positive-mass type cohort is meaningful, but it is a different axiom about a different object.
The computational version needs further choices the paper does not supply. With an explicitly listed sparse polynomial \(W\), the integral can be evaluated term by term. With a succinct circuit, the difficulty depends on that circuit’s representation and arithmetic operations; it could reflect generic symbolic integration rather than the paper’s proposed gains from removing or merging disjointly productive players. The resulting question may be worth studying on its own, but the paper gives no input model or result that makes it a clear computational mirror.
So the negative case is strong against treating this paper as a ChoCo mirror: its named contributions are axiomatic, and its computational motivation is only a suggestion. The universal claim is less secure. Large anonymous cooperative games are a plausible high-multiplicity regime, and the continuous Shapley calculation is a credible research lead. I would call it a new computational problem inspired by the paper, rather than a continuous mirror of a result the paper establishes.
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.