| paper | d4-journals-geb-2008-0066 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
Theorem 12 is a structural characterization, not a computational result under the stated criterion. The proposed finite support rate consistency check is a coherent follow-on, but it is not a computational result established by this paper. The paper therefore fails bit (a), regardless of whether that extension is tractable.
fails bit a — no named computational result to mirror
The proposed extension draws on Theorem 12's weighted-sum representation and bilateral comparison rates; it does not cover the paper's other results, which are also axiomatic rather than computational.
The strongest honest positive case is that the paper itself points toward a continuous population: §6 calls the extension to uncountably many non-atomic agents a challenging open direction. A plausible follow-on would take a non-atomic population with a finite support \(T\) of complete utility types. Each type \(t\) has mass \(\mu_t\), utility vector \(u_t\in\mathbb{Q}^m\), and bilateral comparison rates \(\delta_{tt'}\in\mathbb{Q}_{>0}\) with each other type. The problem would be to decide whether there are positive weights \(\lambda_t\) such that \(\delta_{tt'}=\lambda_{t'}/\lambda_t\) for every pair, and, if so, return those weights and the compact rule
\[
U(x)=\frac{\sum_{t\in T}x_t\lambda_tu_t}{\sum_{t\in T}x_t\lambda_t}
\]
for every coalition taking mass \(x_t\in[0,\mu_t]\) from each type. This asks about a continuous population while retaining the paper’s coalition preferences and bilateral comparisons. For finite rational input, the consistency check reduces to cycle equalities, so I would expect this version to be tractable. That is a proposed extension, not a result established by the paper.
The nearest named result is Theorem 12, proved in this paper. It says that when \(N\) is non-degenerate, every pair has a complete preference, and the weights \(\lambda_i\) are obtained from the bilateral comparison rates along a spanning tree, the Extended Pareto Rule holds if and only if every coalition \(S\subseteq N\) has a complete preference represented by \(u_S=(\sum_{i\in S}\lambda_i u_i)/(\sum_{i\in S}\lambda_i)\). This is a structural characterization, not a computational complexity result. The paper contains no named theorem, lemma, corollary, or proposition asserting that a computational problem is tractable or hard, and no computational formulation that it uses to compute a solution. So there are no qualifying anchors, and no per-anchor problem to hand to a prover under your criteria.
That is the weak point: the continuous-population extension is recognizable from the paper’s own discussion, but the paper’s results concern axiomatic aggregation, not the computational questions ChoCo targets. The candidate above may be worth exploring, but it cannot honestly serve as an anchored computational mirror of a named result in this paper.
The decisive problem is that this paper has no named computational result to mirror. Theorem 12 is a structural characterization: under its assumptions, EPR holds exactly when coalition preferences have the stated weighted-sum form. It gives no algorithmic problem or complexity result. That makes this paper a poor anchor for ChoCo’s computational programme, even though its axiomatic results may be valuable in their own right.
The proposed finite-support version is a coherent continuous-population model, but its consistency test does little computational work. Given pairwise rates \(\delta_{tt'}\), choose a root type, set its weight to \(1\), derive the other \(\lambda_t\) along a spanning tree, then check whether every remaining rate equals \(\lambda_{t'}/\lambda_t\). The population masses \(\mu_t\) do not affect that test. Once the weights are known, evaluating the proposed aggregate utility is a direct weighted sum. This is a simple finite input problem whose central computation is rate consistency, rather than a computational problem in the paper that acquires new structure through continuization.
The stronger version would take a genuinely non-atomic distribution of utility types and ask for a measurable weight function \(\lambda(t)\) satisfying \(\delta(s,t)=\lambda(t)/\lambda(s)\), then derive aggregate preferences for measurable coalitions. That is a natural mathematical extension, and §6 explicitly points toward it. Its main question is still an axiomatic or analytic extension of the representation theorem. To ask about computational complexity, one would need a finite encoding of the type space and rate function. Finite support returns to the spanning-tree check; other encodings would define a new computational problem whose substance comes from the chosen representation.
So the case against a worthwhile *ChoCo mirror* is strong: the paper supplies a plausible continuum population, but no computational result for that population to classify. One could add a task such as repairing inconsistent rates or choosing a coalition to achieve some objective. Those might be worthwhile projects, but the paper does not pose them, and the resulting computational question would need its own motivation and anchor. The negative case is weaker if “worthwhile” includes any follow-on mathematical project: the paper’s own §6 makes the non-atomic extension an inviting one. I would not claim that no scenario could ever be worthwhile; I would say the proposed extension is not a computational mirror of this paper under ChoCo’s stated remit.
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.