| paper | d4-conf-ijcai-2022-0323 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
The paper’s named results are axiomatic impossibilities and a counterexample about paths of lottery improvements; none asserts an algorithm, computational hardness, or a solver formulation used to compute. A distributional analogue can be posed as an axiomatic existence question, but it does not supply the computational anchor required for a continuous mirror.
fails bit a — no named computational result to mirror
The proposed distributional question concerns the axioms in Theorems 1–3; Proposition 5 concerns PC-improvement paths. The paper’s other results and constructions are also axiomatic, and none provides a computational result to mirror.
The strongest positive case is that the paper’s electorate has a plausible high-multiplicity regime. In a large election with standardized rankings over a fixed set of alternatives, a type can be a complete strict ranking, and \(\mu_t\) its share of voters. The electorate may be enormous while the number \(\tau\) of observed rankings is modest. An SDS would then map the distribution \(\mu\) to a lottery over alternatives. That is a credible population-level setting.
The closest anchor is Theorem 2, proved in this paper: for \(m\ge4\) and \(|N|\ge3\), except when \(|N|\in\{4,6\}\), every anonymous and neutral SDS satisfying PC-efficiency is PC-manipulable. It is a substantial impossibility result, but it is not a computational result: it classifies whether axioms can coexist, not the complexity of computing an outcome or deciding a computational problem. Theorem 1 and Theorem 3 are also axiomatic impossibilities; Proposition 5 is an existence result about paths of PC-improvements. None supplies a named complexity anchor.
The nearest continuous question would be: given a distribution \(\mu\) over rankings, does there exist a rule \(F:\Delta(T)\to\Delta(A)\) satisfying anonymity, neutrality, PC-efficiency, and an analogue of PC-strategyproofness? But this remains an axiomatic existence question, outside the programme’s computational scope. There is also a modeling problem: in an atomless population, one person’s report changes no mass, so individual strategyproofness becomes vacuous; requiring resistance to deviations by positive mass changes the axiom and the underlying problem. The paper’s lotteries are continuous in the outcome, while its voters remain finite—a distinction the programme explicitly says is not itself a population continuization.
So the honest positive case is that a natural high-multiplicity scenario exists, and Theorem 2 could motivate an axiomatic continuum study. I cannot give a qualifying continuous computational problem anchored in this paper’s named results, or classify such a problem as tractable, hardness-transferring, or continuum-specifically hard.
Theorem 2 is the strongest possible anchor, and it fails ChoCo’s inclusion test: it proves an incompatibility among axioms for social decision schemes. Theorem 1 and Theorem 3 do the same; Proposition 5 concerns paths of lottery improvements. None states the complexity of a computational problem.
Its natural population version would take a distribution \(\mu\) over rankings and ask whether a rule \(F:\Delta(T)\to\Delta(A)\) can satisfy anonymity, neutrality, PC-efficiency, and PC-strategyproofness. That is still an axiomatic existence question. There is also a real limit issue: a single voter has zero mass, so changing that voter’s report leaves \(\mu\) unchanged. To retain the paper’s manipulation concept, one must preserve a finite electorate size \(n\), so a voter’s deviation changes mass by \(1/n\); the distribution \(\mu\) alone does not record that granularity.
The stronger repair is to ask for the smallest positive mass of a coalition that can profitably change its reported types, perhaps for a specified rule such as maximal lotteries. That could be a worthwhile computational robustness problem. But it replaces individual strategyproofness with a coalition axiom, selects a rule the theorem quantifies over universally, and adds a new optimization objective. The paper supplies no finite representation of an SDS to use as input. This would be a new project motivated by Theorem 2, rather than a computational mirror of it.
The negative case is strongest at that boundary: the paper offers no named computational result for ChoCo to continue. I cannot rule out a useful adjacent project such as mass-manipulation robustness, but it would need its own motivation and problem definition; this paper’s results do not establish its computational anchor.
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.