| paper | d4-journals-mss-2015-0009 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorem 15 gives a global axiomatic existence characterization over finite preference profiles; its arithmetic test is not presented or used as a computational result. The proposed distributional question would be a new axiomatic problem, so no computational anchor survives.
fails bit a — no named computational result to mirror
The proposed mirror reaches only Theorem 15's existence conditions for subcommittee anonymity, subclass neutrality, and reversal symmetry; the paper's other existence, counting, and finite construction results likewise provide no computational result to mirror.
The strongest honest foothold is the population regime: a large assembly can have many members but relatively few distinct rankings. Treat each complete ranking as a type and its population share as mass. That is a sensible continuization of the society.
But this paper contains no named computational result of the kind required for an anchor. Its closest result is Theorem 15, proved in this paper and restated in the introduction as Theorem A. For a partition \(B\) of individuals into subcommittees and a partition \(C\) of alternatives into subclasses, it says:
These are existence characterizations for social welfare functions over all finite preference profiles. They do not classify the complexity of a problem on a society given as a distribution over types. The theorem’s arithmetic condition is computable, but the paper does not present it as a complexity result, and its input is not a continuous population.
One could propose a follow-on asking whether a distribution over ranking types admits a rule satisfying continuous versions of minimal majority, neutrality, and reversal symmetry. That would be an axiomatic existence question, not a computational mirror anchored in this paper. So I would not name a continuous computational problem or assign it to the programme’s tractable/hard trichotomy here. The weak point is decisive: the population model is plausible, but the paper’s results do not supply the required computational anchor.
Theorem 15 is the only plausible anchor, and its best computational reinterpretation still misses the programme’s target. One could take the subcommittee and subclass sizes as input and ask whether a symmetric minimal-majority rule exists, or construct one. But the theorem’s test depends only on those cardinalities; the input contains no society distribution \(\mu\). Its output is a rule defined over every finite profile, not an algorithm acting on one high-multiplicity society. Making the committee large leaves this a global axiomatic existence problem, not a complexity question about a population given by type masses.
A direct continuous version exposes a further problem. Take \(\mu\) uniform over all rankings. It is unchanged by every permutation of alternatives. A neutral deterministic rule with strict-ranking outcomes would therefore have to return a ranking unchanged by every alternative permutation, which is impossible. Likewise, a society invariant under reversal makes a reversal-symmetric strict-ranking rule impossible. The finite paper’s arithmetic conditions avoid these fixed-point obstructions in some committee sizes; a continuum admits the symmetric societies regardless of those conditions. Restricting the domain to exclude them would remove natural population cases, while allowing ties or set-valued outcomes changes the outcome model and the question.
A chairman represented by a distinguished agent could break some of these symmetries, as in Corollary 16. That is the strongest repair I can see, but it still yields an axiomatic question about constructing a global rule. The paper gives no computational result to mirror, and the chairman variant does not supply one. A separate algorithmic problem could be invented around evaluating a rule on a particular distribution, but that would not be a continuous mirror of Theorem 15. The negative case is therefore strong on programme fit; it cannot rule out every worthwhile follow-on problem someone might formulate from this paper.
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.