| paper | d4-journals-mss-2015-0060 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The proposed anchors are axiomatic characterizations, not named computational results under the stated criterion. A cohort-based computational study would require supplying a new task and input representation, so it cannot provide a continuous mirror anchored in this paper.
fails bit a — no named computational result to mirror
The paper's value characterizations and impossibility results are axiomatic; none supplies a computational result for a continuous mirror to cover.
I cannot make an honest anchored case for a continuous computational mirror of this paper: it contains no named computational result. Its propositions characterize solution values through axioms, or prove axiomatic impossibilities; none asserts that a computational problem is in P, hard, FPT, or otherwise classifies its complexity.
The closest anchors are Proposition 5(i), proved here: among values satisfying Efficiency and Balanced cycle contributions, invariance when deleting a player while a nullifying player remains holds exactly for the Equal Division value. Proposition 5(ii), also proved here, gives the corresponding characterization of Equal Surplus Division when a dummifying player remains. Proposition 6 characterizes the weighted division classes under Efficiency, Linearity, and the respective deletion invariance axioms. These are substantive results, but they do not meet your required computational-anchor criterion. The impossibility results, including Propositions 8 and 9, are axiomatic too.
A plausible *follow-on* could study cooperative production by large cohorts of interchangeable agents: a type records an agent’s full role, mass records that type’s share of the population, and coalition worth depends on the vector of type masses. One could ask how to compute per-capita allocations after removing a positive mass of agents while a nullifying or dummifying type remains. But the paper neither studies that model nor proves a computational result about the finite-player problem that it could anchor. In particular, a lone special player has zero mass in a nonatomic population, so preserving the paper’s deletion condition would require a positive-mass special cohort—a meaningful model change.
That is also the weakest point in any positive case: the continuous model would be a new computational problem built beside the paper’s axiomatic characterizations, not a continuous version of a named complexity result from it. Under the requested anchor standard, I would not present it as a genuine mirror.
The proponent identifies the decisive gap: this paper states no computational problem and proves no complexity or algorithmic result. Proposition 5(i) characterizes Equal Division; Proposition 5(ii) characterizes Equal Surplus Division; Proposition 6 characterizes weighted classes. Their hypotheses concern values and axioms, not the running time of an algorithm on an encoded game. The impossibility results are axiomatic too.
Those are the strongest proposed anchors, and each runs into the same issue. For an explicitly represented game, the characterized outputs have direct formulas: Equal Division uses \(v(N)\), while Equal Surplus Division uses \(v(N)\) and the singleton worths. Proposition 6 likewise specifies exogenous weights and a formula. The paper does not choose a representation for \(v\), define an allocation-computation task, or analyze its complexity. A high-multiplicity version would need a representation of coalition worths over type counts or masses. Any complexity claim would depend on that added representation and on a task the paper never poses.
The best improved mirror would use interchangeable cohorts in a cooperative production game: types encode complete, shared characteristics; coalition worth depends on cohort counts; and a continuum model uses masses. Positive-mass nullifying or dummifying cohorts would avoid the objection that a single player disappears in the limit. That is a coherent possible model. It still does not turn the paper’s characterizations into computational results. If the task is to calculate one of its characterized allocations, the formulas already specify what to calculate. If the task instead optimizes an allocation, searches over value rules, or computes worths from a production model, those objectives and their input structure must be supplied from outside this paper. The paper’s general \(Q\) is an arbitrary function on TU-games, so its results also provide no effective representation for a computational treatment.
I would treat a cohort-based computational study as a possible adjacent project, not a continuous mirror of this paper. The universal negative claim is weaker: symmetric, high-multiplicity cooperative games are plausible, and they might support worthwhile computational research. The firm case against a mirror is narrower and stronger: none of the proposed anchors gives ChoCo a computational question from this paper to continuize.
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.