| paper | d4-journals-mss-2017-0059 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Neither anchored theorem meets the computational-result requirement: Theorems 4 and 5 concern growth and bounds on dimension. The paper’s mention of NP-hardness refers to prior work, so it cannot supply a computational anchor established here.
fails bit a — no named computational result to mirror
No computational result from this paper is covered; the cited exact-dimension NP-hardness is prior work.
I can’t make a compliant anchor-backed positive case: the paper has no numbered result establishing a computational-complexity classification for an underlying problem.
The closest result is Theorem 4, proved here: among disjunctive hierarchical games with a bounded number of players in each equivalence class, the worst-case dimension can grow exponentially with the number of players. That is a theorem about growth of a representation parameter, not about the complexity of computing it. Theorem 5, also proved here, bounds the dimension of conjunctive hierarchical games; it has the same limitation.
The paper mentions that exact dimension computation is NP-hard, but attributes that result to Deĭneko and Woeginger (2006); it is neither a numbered result of this paper nor a result the authors establish. A continuous-population version of dimension could be a new research question, but it would not supply the required mirror of a computational anchor.
The proponent has effectively withdrawn the positive case: it supplies no valid computational anchor from this paper. Theorem 4 proves exponential growth of a representation parameter; Theorem 5 bounds that parameter for another class of games. Neither gives a complexity classification or an algorithmic result. The cited NP-hardness of computing dimension belongs to Deĭneko and Woeginger’s earlier work, so it cannot fill the gap in a case required to anchor on this paper’s results.
The best repair for Theorem 4 would replace each desirability class with a continuous mass and ask for the dimension of the resulting hierarchical game. That exposes a structural problem with the natural type-level version. For the paper’s two-class example with thresholds \((2,5)\), the continuous winning region is
\[
\{(x_1,x_2):x_1\ge 2\}\ \cup\ \{(x_1,x_2):x_1+x_2\ge 5\}.
\]
It is nonconvex: \((2,0)\) and \((0,5)\) win, while their midpoint loses. A weighted game over type masses is a halfspace, and an intersection of such games is convex. So this natural continuous version has no exact intersection representation. In the finite game, the coalition lattice lets the representation distinguish individuals within a desirability class; the paper’s Section 4 example shows that this can matter. Preserving that freedom in the continuum requires tracking individual-level distinctions the mass model erased. Approximate representations might be worth studying, but they need a new error criterion and would be a separate question.
The regime behind Theorem 4 also weakens its fit: its exponential growth keeps the number of players per equivalence class bounded while the number of classes grows. The paper’s Theorem 3 gives the complementary fixed-class result. This makes the headline exponential family primarily a growth in type diversity, not a result about many interchangeable members of a fixed set of types.
For Theorem 5, the natural continuous analogue is a region cut out by prefix-threshold inequalities. Its representation question becomes one about the facets or irredundant inequalities of a finite-dimensional polyhedron. That might be a clean geometric observation, but it does not mirror a computational result in the paper.
The categorical claim that no scenario could ever yield worthwhile work is weaker. One could independently study the high-multiplicity version of the cited exact-dimension problem. That might be a sensible research question, but it is an extension motivated by prior work, not a continuous mirror of a result established here. The strongest defensible negative verdict is therefore that this paper offers no worthwhile *paper-anchored* continuous mirror; a broader claim ruling out every adjacent project would go beyond the evidence.
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.