| paper | d4-journals-jet-2003-0044 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
The named results are axiomatic characterizations and a structural range proposition; none asserts an algorithm, computational hardness, or a solver-based formulation, so bit (a) fails. The proposed mass-threshold rule is a plausible model extension, but adding a new computational task would not make it a computational result of this paper.
fails bit a — no named computational result to mirror
No named computational results are covered; the proposed rule extension draws on the support-threshold idea but does not continue the paper’s axiomatic theorems as computational results.
I can make a weak model-level case for continuity, but this paper supplies no named computational result to anchor it. Theorem 1, proved here, characterizes exactly the Liberal-Democratic Rules satisfying Monotonicity, Independence, Duality, and Symmetry, with support \(s\) in the stated range; it also says the four axioms are independent. Theorems 2 and 3, also proved here, characterize the Liberal Rule using Exclusive and Affirmative Self-determination, respectively. Proposition 1 gives a structural restriction on the range of rules satisfying Independence. None asserts that a computational problem is in P, hard, fixed-parameter tractable, or otherwise classifies its complexity. So there are no eligible anchors and no continuous problem per anchor to hand to a prover.
A possible population-level translation would represent opinions by a binary relation \(p(x,y)\), where \(x\) is a voter and \(y\) a person being qualified, and return a measurable set of qualified people. One might replace the finite support \(s\) by a population fraction \(\alpha\), qualifying \(y\) according to the mass of voters whose view of \(y\) agrees with \(y\)’s own view. But that extends the paper’s aggregation rule; it does not mirror a computational result in the paper. It also leaves a modeling issue: in a nonatomic population, the diagonal self-view \(p(y,y)\) has zero mass, so a type distribution alone may not preserve the role the paper gives to each person’s view of themself.
The strongest honest positive point is therefore only that a continuum version of the paper’s *model* is imaginable. Turning it into a computational question would require adding a task and assumptions the paper does not study. Its results are axiomatic characterizations, not a complexity landscape.
The strongest case against is that there is no computational result in this paper to mirror. Theorem 1 characterizes rules satisfying four axioms; Theorems 2 and 3 characterize the Liberal Rule under self-determination axioms. Proposition 1 constrains the range of rules satisfying Independence. None studies the complexity of a computational problem. The proponent is right that there are no eligible anchors.
A continuous model is still imaginable. For each person \(y\), let \(p(x,y)\) record voter \(x\)’s view of \(y\), and let \(d(y)\) record \(y\)’s own view. A mass threshold could qualify \(y\) when enough voters agree with \(d(y)\). The zero-mass diagonal makes \(p(y,y)\) alone inadequate, but adding \(d(y)\) explicitly repairs that modeling issue. It does not create a computational question from the paper: it extends an axiomatic rule, and its output is a pointwise threshold decision. A new task—such as changing opinions at minimum cost to alter the qualified set—could be studied, but its objective and complexity would be additions to the paper, not continuizations of one of its results.
The universal claim that no worthwhile continuous mirror exists in any scenario is harder to defend than the narrower conclusion that this paper is a poor ChoCo target. One could construct a plausible continuous society and investigate new computational problems on it. But that possibility does not supply a computational result for this paper to continue. Its continuous extension may be worthwhile as model-building; on the evidence here, it offers no computational mirror for the programme.
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.