| paper | d4-conf-atal-2021-0180 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper’s numbered theorems establish axiomatic impossibilities and implications; none gives an algorithm, complexity bound, or hardness result for computing an outcome. The proposed mass-bloc question is statable, but it changes unilateral strategyproofness and still does not provide a computational anchor.
fails bit a — no named computational result to mirror
The proposed mass extension covers Theorem 2’s support-basedness, Pareto-optimality, strategyproofness, and nominator conclusion; it leaves Theorems 1 and 3 unmodeled.
The strongest honest positive case is a natural population-level extension of Theorem 2, but it does not meet the programme’s computational-anchor requirement. The paper contains no named result asserting that a problem is in P, hard, FPT, or otherwise computationally classified. Theorem 1, proved here, says that no rank-based SCF can satisfy Pareto-optimality and Kelly-strategyproofness when \(m\ge4\) and \(n\ge3\). Theorem 2, proved here, says that every support-based SCF satisfying Pareto-optimality and Kelly-strategyproofness makes every voter a nominator when \(m\ge3\). Theorem 3, proved here, says that no Kelly-strategyproof SCF can satisfy both the Condorcet loser property and non-imposition when \(m\ge3\) and \(n\ge4\). These are axiomatic results, not computational-complexity results, so none is an eligible anchor.
The most plausible continuous question suggested by Theorem 2 is this. Let \(A\) be a finite set of at least three alternatives, and let \(T\) be a finite set of weak rankings of \(A\). A society is a rational distribution \(\mu\) over \(T\), with support size \(\tau\); \(\mu_t\) is the fraction of society with ranking \(t\). Let \(F\) map such societies to nonempty choice sets, depend only on the pairwise-support vector, and be Pareto-optimal, where domination means weak preference by every positive-mass type and strict preference by some positive mass. Give strategic behavior a population-level meaning: a mass \(\delta\), where \(0<\delta\le\mu_t\), of type \(t\) may report another type \(t'\), changing the society to \(\mu-\delta e_t+\delta e_{t'}\). Require that this transfer never produce a choice set strictly Kelly-preferred by the deviating type. The question is whether, for every such \(F\) and every society \(\mu\), each occupied type \(t\) has at least one top-ranked alternative in \(F(\mu)\): \(F(\mu)\cap\operatorname{Top}(t)\ne\varnothing\).
This has a sensible high-multiplicity regime: a large electorate with many voters but relatively few distinct weak rankings. Rankings are complete types for the model, masses are population shares, and transfers describe a group of like-minded voters changing their reported ranking. The question preserves Theorem 2’s support-basedness, Pareto condition, Kelly comparison, and nominator conclusion. I would conjecture the conclusion might survive, but it needs a new proof: the transfer models a coordinated mass bloc, whereas the theorem concerns one voter at a time.
That difference is the proposal’s weakest point. In an atomless population, one person has zero mass and cannot change the outcome; giving a bloc the ability to shift positive mass changes the strategic question. More fundamentally, this mirror asks for an axiomatic theorem, with no objective or algorithmic task. It could be a worthwhile continuous-population extension of Theorem 2, but it is not a ChoCo complexity anchor, and the programme’s tractable/transferred-hardness/continuum-hardness classification does not apply to it.
The strongest case against is that this paper offers no computational result to continuize. Theorems 1–3 establish axiomatic impossibilities and compatibility claims: they concern which social choice functions can satisfy strategyproofness, Pareto-optimality, and related properties. None classifies an algorithmic problem by complexity or gives an optimization task. So none supplies an anchor for ChoCo’s tractability, hardness-transfer, or continuum-specific-hardness landscape. Turning one into manipulation detection or a mass-robustness optimization problem would introduce a new computational question whose difficulty depends on how the rule is represented; it would not mirror a computational question in this paper.
The proposed Theorem 2 extension is the strongest candidate. A society with mass distributed over a small set of weak rankings is a sensible high-multiplicity model, and support-basedness, Pareto-optimality, and nominators all have natural mass versions. The obstacle is strategic: a single voter has zero mass, so an individual deviation leaves the society unchanged. To get a nontrivial deviation, the proposal lets a positive-mass bloc change its report. That is a coalition-manipulation axiom, rather than a continuous version of the paper’s unilateral Kelly-strategyproofness. It could be worth studying as axiomatic social choice, but it supplies no computational question for ChoCo. Requiring a coherent continuous rule across population sizes would also add a condition absent from the paper’s fixed-\(n\) theorems.
The same point applies to Theorems 1 and 3: one can replace counts by masses and ask whether their axiomatic conclusions persist, but that does not create an algorithmic result to classify. A later project might ask for the minimum mass that can manipulate a given rule. That would be a new, rule-dependent optimization problem, not a mirror anchored in this paper.
I would not claim that no continuous extension could be worthwhile anywhere in social choice. The honest negative is narrower: this paper gives no worthwhile ChoCo computational mirror to pursue. The proposed Theorem 2 extension may be mathematically sensible, but it belongs to a different research question.
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.