| paper | d4-journals-jet-2021-0044 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 1 and Propositions 1–2 are axiomatic characterizations, not named computational results. Replacing the finite agent set with a distribution over types would give an axiomatic extension; adding an optimization task over acts would introduce a computational problem absent from the paper.
fails bit a — no named computational result to mirror
No anchors were raised. Theorem 1 and Propositions 1–2 characterize social welfare functions; none states a computational result to mirror.
I can’t make an honest, anchored positive case: the paper contains no named computational result. Its Theorem 1, proved in the paper, is an axiomatic characterization. For a finite set of agents, it says that a social welfare function satisfying restricted monotonicity, independence of redundant acts, faithfulness, no belief imposition, continuity, and anonymity agrees with belief-averaging and relative utilitarianism on every non-common utility profile: society uses the average belief of concerned agents and the sum of their normalized utility functions. Propositions 1 and 2 are also axiomatic characterizations. None establishes an algorithm, complexity class, or hardness result for a computational problem.
The non-atomic beliefs in the paper concern uncertainty over states. The set of agents remains finite, so that feature is not a continuous-population model. A population-measure extension could be proposed, but it would be a new computational question, not a mirror anchored in a named computational result of this paper.
The proponent’s case concedes the strongest point: it names no computational result to mirror. Theorem 1 characterizes a social welfare function from axioms; Propositions 1 and 2 characterize related classes. None defines an algorithmic problem or proves a complexity bound or hardness result. The paper’s non-atomic beliefs are distributions over states of the world, while its set of agents remains finite. Neither feature supplies the continuous-population computational question ChoCo is looking for.
The best population-continuous reformulation would replace the finite set of agents with a distribution over complete subjective expected utility types, then aggregate beliefs and normalized utilities by integration. That could be a worthwhile axiomatic extension, but it asks a different kind of question from the programme’s computational ones. A computational task would need something extra, such as a specified feasible set of acts to optimize over. With finite, explicitly represented types, computing the aggregate for a given act is just aggregation; any substantial complexity would come from the added optimization problem or the encoding of beliefs and utilities, neither of which the paper studies.
So the negative case is strong for a mirror of this paper: none of the proponent’s anchors survives because none was raised. It is weaker as the universal claim that no useful computational project could ever grow out of the paper. Such a project is possible, but it would need a new problem definition and would not be anchored in a computational result here.
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.