| paper | d4-journals-jet-2001-0001 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorems 1–3 analyze mechanisms that implement allocation values in SPE, but none states an algorithm, complexity bound, hardness result, or computational formulation used to solve instances. A type-mass version would also require a coalition-value model the paper does not supply, so no proposed mirror clears the computational-result requirement.
fails bit a — no named computational result to mirror
No result is covered by a computational mirror; Theorems 1–3 and the weighted implementation results concern equilibrium outcomes.
I can’t make an honest case with an eligible anchor: the paper has no named computational complexity result of the kind this task requires.
Theorem 1 says the bidding mechanism implements the Shapley value of a zero-monotonic game in subgame perfect equilibrium. Theorem 2 says its weighted version implements the weighted Shapley value. Theorem 3 says the generalized mechanism implements the Shapley value of the game’s super-additive cover. These are results about equilibrium outcomes and implementation; none classifies the complexity of a problem, gives a computational formulation the paper uses, or analyzes an algorithm’s running time. Lemma 1 gives a recursive identity for the weighted Shapley value, but likewise makes no computational claim.
A continuum of agent types and masses could inspire a separate research question—for example, how to define and compute a Shapley-like allocation in an atomless transferable-utility game. But the paper’s players are named members of a finite set \(N\), and its recursive mechanism removes one proposer at a time. Replacing that population with mass changes the object and may erase the recursion’s basis. The continuous real-valued bids and payoffs in the paper concern action and outcome spaces; they do not make the population continuous.
So there is no continuous problem per eligible anchor to hand to a prover. The strongest possible starting point would be Theorem 3, but treating it as a computational anchor would violate the stated standard. The main weakness is therefore decisive: any positive mirror here would be a new extension of the paper’s game-theoretic model, not a continuous mirror of one of its computational results.
The three theorems the proponent names are implementation results. Theorem 1 implements the Shapley value, Theorem 2 its weighted version, and Theorem 3 the Shapley value of the super-additive cover. Each characterizes equilibrium outcomes; none states a computational problem’s complexity or gives an algorithm with a running-time bound. Lemma 1 is a recursive identity. The paper says the equilibrium strategies are easy to compute, but it gives no input representation or complexity analysis. There is no computational result here for ChoCo to continuize.
The strongest possible reconstruction is Theorem 3: describe agents by types, give the value of a coalition as a function of its type masses, then study how to compute an efficient coalition partition and a corresponding continuum allocation. That could be a coherent research question, perhaps even one suited to continuous optimization. But the paper supplies neither that type-composition value function nor a way to encode it. Its game allows an arbitrary \(v:2^N\to\mathbb R\); a distribution over types does not determine coalition values unless additional symmetry assumptions are imposed. Those assumptions may describe sensible high-multiplicity settings, but choosing them, specifying the input, and defining the continuum allocation would create the computational problem rather than mirror one the paper studied.
The same gap applies to Theorems 1 and 2. A continuum version of their bidding mechanisms would require a specified mass-based game and rules for choosing a proposer and handling acceptance. Those may be worthwhile mechanism-design questions, but they do not supply a missing complexity result. The continuous bids, weights, and payoffs in the paper concern actions and outcomes, not a continuous population.
This is a strong reason to exclude the paper as a ChoCo mirror. It does not prove that no adjacent continuous study could be worthwhile: a carefully specified coalition-mass optimization problem might be. The narrower conclusion is that such a study would introduce the model and computational target; it would not continuize a computational result of this paper.
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.