| paper | d4-journals-jet-2010-0036 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
No named result in the paper asserts an algorithm, complexity bound, hardness result, or a formulation used for computation. Theorem 1 is an axiomatic characterization, and Proposition 16 gives structural conditions for majority consistency; their population analogue is a sensible follow-up, but it cannot meet the computational-anchor requirement.
fails bit a — no named computational result to mirror
The opponent's decisive point is that the population majority-consistency question is a new computational follow-up, while the paper proves no computational result to anchor it.
fatal: True
The possible population follow-up concerns majority consistency, closest to Proposition 16(a) and (b). Theorem 1's axiomatic characterization and the paper's other structural domain conditions yield no computational mirror here.
The paper has no qualifying computational anchor: none of its numbered results classifies a problem as polynomial-time solvable, hard, fixed-parameter tractable, or similar. Theorem 1, proved here, says that on any domain containing \(D_2\), consistency, anonymity, and acceptance/rejection neutrality force an aggregation function to be majority voting. Proposition 16(a), also proved here, says that value restriction guarantees a consistent majority outcome; Proposition 16(b) gives the corresponding result for weak value restriction when individual judgments are complete. These are substantive mathematical results, but they do not report computational complexity.
The closest plausible population mirror would take a type to be a complete, consistent judgment set over a fixed agenda, with \(\mu(A)\) the fraction of society holding that type. The issue-wise majority accepts \(p\) when \(\sum_{A:p\in A}\mu(A)>1/2\); the question is whether the resulting collective judgment set is consistent. A large group of constituents with relatively few distinct judgment types is a plausible regime, and the authors would recognize the question as a population version of their majority-consistency problem. Proposition 16’s overlap argument carries over to masses: two sets of types each with mass greater than \(1/2\) must overlap.
That is a plausible new computational follow-up, not a mirror anchored in a computational result of this paper. Under your anchor requirement, I cannot honestly provide a per-anchor continuous problem or claim the paper supplies a complexity landscape.
The paper has no numbered computational result to mirror. Theorem 1 characterizes aggregation rules; the propositions give structural conditions under which majority outcomes are consistent. Neither defines an algorithmic problem or claims a complexity bound. On ChoCo’s computational criterion, there is no anchor.
The strongest population version is sensible: represent a large group by a distribution \(\mu\) over complete, consistent judgment sets, and accept \(p\) when the mass of types accepting \(p\) exceeds \(1/2\). But the proposed analogue of Proposition 16 is a measure-level restatement of its overlap argument: two sets each having mass greater than \(1/2\) must overlap. That gives a natural theorem about a continuum society, not a computational mirror of a result in this paper.
One could turn the setting into a computational project by asking, for example, whether a given distribution’s majority outcome is consistent, or whether its support satisfies a particular domain restriction. But that requires adding a decision or search problem, along with choices about how the agenda, logic, and distribution are represented. A distribution-level version of Theorem 1 would instead be axiomatic. These could be worthwhile new projects; neither is a computational question the paper itself poses or answers.
So I would not argue that no continuous judgment-aggregation research could be worthwhile. The narrower negative claim is strong: no scenario or type-space choice supplies a worthwhile mirror of this paper’s computational result, because the paper has no computational result to mirror.
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.