| paper | d4-journals-geb-2018-0151 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper’s named theorems characterize existence and uniqueness of values under axioms; none gives an algorithm, complexity bound, hardness result, or solver-based formulation. The required computational-result gate therefore fails before a continuous-population mirror can be assessed.
fails bit a — no named computational result to mirror
The proposed population scenario is described as a follow-on requiring a new model; no computational result in the paper is covered.
I cannot make a compliant anchor-based case for a continuous mirror: the paper contains no named computational result asserting tractability, hardness, or a parameterized complexity classification.
The closest result is Theorem 3, proved in this paper: a graph value is uniquely defined exactly for the complete graph \(K_n\) and the cycle \(C_n\). That is a classification of when the paper’s axioms determine a unique value, not a complexity result about computing one. Theorem 1 likewise characterizes when an \(S\)-value exists, and Theorem 2 gives equivalent axiomatic conditions for uniqueness on well-connected admissibility structures. None supplies a qualifying computational anchor.
There is a plausible high-multiplicity setting nearby: many interchangeable organizations forming coalitions subject to network constraints, with mass representing the share in each role and allocation representing value per member. But aggregating players by role can erase which coalitions are connected; retaining enough network structure to preserve that information would itself require a new model. Even if that model led to a useful computational question, it would be a follow-on, not a mirror of a named computational result in this paper. So there is no anchor here for which I can state the requested continuous problem without inventing one.
The strongest case against a mirror is the proponent’s central point: this paper has no named computational result to continuize. Theorem 1 characterizes when an \(S\)-value exists; Theorem 2 gives equivalent axiomatic conditions; Theorem 3 classifies the finite graphs on which the axioms determine a unique graph value. None studies the complexity of computing a value, or gives an algorithmic classification for a problem with an input encoding and parameters. A continuous computational question prompted by these theorems could be worthwhile in its own right, but it would be a new project rather than a mirror of a result in this paper.
The suggested scenario—many interchangeable organizations forming coalitions under network constraints—is the strongest way to try to supply a population axis. Its difficulty is that connectedness belongs to the *relations between particular players*, not just to their roles or preferences. Coalitions with the same mass in each role can have different connectivity. If a type records enough neighborhood information to distinguish those coalitions, the number of types can grow with the graph and the high-multiplicity compression disappears. If types retain only roles and masses, the admissible-coalition structure is no longer determined.
A scaled network or graphon could preserve some aggregate structure, but then the paper’s key object needs new semantics. In its model, chains add or remove one player at a time, and marginal contributions compare the worths of adjacent admissible coalitions. A nonatomic population has no positive-mass effect from adding one individual. Replacing those steps with transfers of mass requires defining which measurable coalitions are admissible, how their worths are specified, and how marginal contributions work. That may lead to an interesting continuous theory, but it does not preserve the paper’s axiomatic results as computational questions.
The best candidates do not escape this problem. Theorem 3’s complete graphs offer a highly symmetric population, but extending the Shapley value to a continuum game would require a new worth model; its result here is still axiomatic. For cycles, the same issue remains alongside the need to define what connected coalitions and admissible orderings mean in the limit. Theorems 1 and 2 likewise concern existence and uniqueness under axioms, so their continuous counterparts would continue the paper’s axiomatic programme rather than add the computational complexity programme’s target.
This is not a proof that no useful ComSoC research could grow from the paper. It is a strong reason to reject the proposed *mirror*: even the most plausible high-multiplicity setting requires changing the networked coalition model, while none of the paper’s named results supplies a computational problem to carry across.
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.