| paper | d4-journals-jet-2010-0102 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
Theorem 1 characterizes which aggregation functions satisfy specified axioms; it does not classify a computational problem. A distributional version could pose a related axiomatic question, while adding mass interventions would introduce a new decision problem, so neither gives a computational mirror of a result in this paper.
fails bit a — no named computational result to mirror
No result is covered by a continuous computational mirror: Theorem 1 and the paper’s other named results concern axiomatic classifications or existence of aggregation rules.
I can’t make a qualifying positive case: the paper contains no named computational result of the required kind. Its numbered results are axiomatic characterizations, not claims that a computational problem is in \(P\), NP-hard, FPT, or otherwise computationally classified.
The closest anchor is Theorem 1, proved in this paper. For finite \(N\) with \(|N|\ge3\), conditions (a)–(c) hold if and only if every social judgment function with deductively closed, consistent outputs that satisfies independence on \(P\) and unanimity preservation is oligarchic on \(P\); when outputs must also be complete, every such function is dictatorial on \(P\). That is a characterization of aggregation rules, not a complexity result.
One could imagine a neighboring continuous model: types are complete, consistent individual judgment sets \(B\in D\); \(\mu_B\) is the fraction of society holding each type; and the task is to characterize collective judgments produced from \(\mu\) under counterparts of independence and unanimity. But that would continuize an axiomatic question, which the programme places out of scope. The paper’s allowance for infinite \(N\) does not itself supply a distribution over types or a computational problem with an input size.
So there is no honest continuous computational problem to state per anchor here. The paper’s treatment of infinite populations may be relevant background, but it cannot carry the requested case for a continuous computational mirror.
The strongest case against a continuous mirror is that the paper has no named computational result to mirror. Its closest anchor, Theorem 1, characterizes which aggregation functions satisfy axioms: under conditions on the agenda, they must be oligarchic or dictatorial on the premisses. It says nothing about an algorithm, a decision problem, or computational complexity.
The best apparent rescue is to assign masses to types—complete, consistent judgment sets—and ask which collective judgments follow. But that continuizes an axiomatic question, which ChoCo explicitly excludes. The paper’s Theorem 1′ and its results on anonymous ultra-filter rules do not change this: they allow an infinite set of individually indexed people and reason about coalitions of those people. They do not represent society as a distribution over types or pose a computational task.
One could instead ask how to change a society’s type masses to achieve a desired judgment, or how to check agenda conditions (a)–(d). Those might be worthwhile new problems. But the first requires adding an intervention model and objective absent from the paper; the second computes properties of the agenda, not of a continuous society. Neither mirrors a result the authors establish.
So the negative case is strong within the programme’s scope: even though repeated judgment types are a sensible high-multiplicity regime, this paper supplies no computational finding for a continuous population to explain, extend, or classify. The universal claim that *no* related scenario could ever be worthwhile is harder to prove; the defensible conclusion is that any such project would be new work inspired by the paper, not a continuous mirror of its results.
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.