| paper | d4-journals-geb-2024-0058 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The numbered results characterize potentials, restriction operators, and the MPW solution through axioms and identities; none asserts an algorithmic or hardness result. The proposed type-mass allocation is presented as follow-on work, and both cases agree it would need a new model and computational task.
fails bit a — no named computational result to mirror
Theorem 7, Theorem 14, and the cited Theorem 2 are characterizations or identities; no computational result is covered.
The only honest positive foothold is a plausible population setting: a large industry with many interchangeable firms or workers in a small number of types, where coalition worth depends on how the outsiders form coalitions. Type mass could represent each role’s share of the population, and one could seek a type-level analogue of the MPW allocation. That would continuize the population itself, but it is a motivation for new work, not a mirror of a computational result in this paper.
There is no qualifying anchor. The closest results are Theorem 7 (proved here), which characterizes the unique path-independent restriction operator preserving null games whose potential equals the expected accumulated worth for a given positive random partition, and Theorem 14 (proved here), which characterizes the Ewens partition and MPW solution under the paper’s null-player or monotonicity conditions. Theorem 2 is a cited result of Casajus (2014) giving the TU-game potential as expected accumulated worth. These are mathematical and axiomatic characterizations; none asserts an algorithmic or complexity result for a computational problem.
So I cannot state a continuous problem per anchor or assign it a tractable, hardness-transfer, or continuum-specific-hardness expectation without inventing the computational question. The weak point is decisive under your criterion: the paper studies which solution and restriction operator satisfy certain properties, not the complexity of computing them. A continuous MPW computation problem may be worthwhile, but it would be an unanchored follow-on.
The decisive objection is that this paper has no computational result to mirror. Theorem 7 characterizes a restriction operator under axioms; Theorem 14 characterizes the Ewens partition and MPW solution under further axioms; Theorem 2, which the paper cites from earlier work, gives a formula for the TU-game potential. None poses a search or decision problem, analyzes complexity, or gives an exact, approximation, or parameterized algorithm. These are the strongest candidate anchors, and each is a mathematical characterization rather than a computational result.
The industry example does suggest a plausible high-multiplicity setting. One could model many interchangeable firms or workers as types and let coalition worth depend on how the remaining population forms coalitions. But the paper gives no computational question for that setting. A natural follow-on might ask for the limiting MPW payoff per type, or an algorithm to approximate it. The first is an asymptotic or analytic question; the second requires a new input model and representation of coalition worths. Neither mirrors a result proved here.
That gap is substantive. In the paper, worth is an arbitrary function of embedded coalitions \((S,\pi)\), and externalities make the partition of the outsiders relevant. A type-mass distribution alone does not capture that information. An anonymous, mass-based version might be sensible, but imposing it and deciding how to encode its worth function would define a new problem. With the paper’s explicit finite-game representation, computing its finite sums is proportional to the size of the input table; succinct representations could yield different complexity questions, but their answers would depend on choices the paper never makes.
So the strongest negative case is that this paper is outside the continuization programme’s computational remit: there is no computational finding for a continuous population model to test, and the best proposed mirror becomes a new research project once one supplies the missing model and task. That is a strong case against a *mirror of this paper*. It is not a proof that no worthwhile computational study could grow from its ideas; that broader impossibility claim is the weak point, and would overstate what the paper lets us conclude.
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.