| paper | d4-conf-ijcai-2021-0150 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The named results establish whether specified SDSs satisfy strategyproofness, decisiveness, and efficiency conditions; they do not give a running-time bound, computational hardness result, or solver-based formulation used to compute. The computational-result gate therefore fails for every candidate, even though a society represented by type masses is plausible.
fails bit a — no named computational result to mirror
No computational result is covered; the paper's axiomatic results on $k$-unanimity, Condorcet-consistency, and ex post efficiency remain outside the computational-mirror scope.
I can’t make an honest anchor-based positive case from this paper: it contains no named computational result asserting a complexity classification or giving an algorithm for an input problem.
The closest tempting anchors are the \(k\)-unanimity theorem (labelled thma) and the rank-based impossibility theorem (thmb), both proved here. The first characterizes when \(\mathit{RD}^k\) and \(\mathit{OMNI}\) are \(U\)-strategyproof; the second rules out rank-based SDSs satisfying \(k\)-unanimity and \(u^\Pi\)-strategyproofness under a stated utility-gap condition. The Condorcet results (thmc, thmd) and the ex-post decisiveness bound (thm:expost1) are also axiomatic compatibility, impossibility, or characterization results. None asks whether an input instance is solvable or studies an algorithm’s complexity. Treating one as a computational anchor would invent a problem and attribute it to the paper.
A plausible *new extension* would represent an electorate by masses over complete preference-and-utility types and choose an SDS mapping each society to a lottery, perhaps maximizing decisiveness subject to incentive and efficiency constraints. But that is not a mirror of a computation in this paper. In an atomless population, one voter’s report changes no mass, so unilateral strategyproofness becomes vacuous; preserving incentives would require a different deviation model, such as finite-mass coalitions. That changes the strategic question. Under the programme’s anchor requirement, there are zero continuous problems to specify per anchor, and no tractable, hardness-transfer, or continuum-specific classification to predict.
The strongest case against a mirror begins at the programme’s gate: the appended case names no computational anchor. That is a real absence here. Theorem thma characterizes when specified schemes satisfy axioms; thmb and thmc give incompatibility results; thmd characterizes an SDS on some profiles; and exposta bounds decisiveness. None studies the complexity of an input problem or gives an algorithm. The computer-aided example \(f^2\) is a finite construction, not a complexity result. There is no paper result to place in the programme’s tractable, hardness-transfer, or continuum-specific classes.
That is not a claim that a high-multiplicity voting regime is implausible. A large electorate over relatively few complete preference-and-utility types is a natural case. The paper’s axioms also admit recognizable population versions: \(k/n\) can become a mass threshold, pairwise margins can be computed from type masses, and Pareto efficiency can be stated for almost all of the population. Those would be continuous axiomatic questions, which the programme explicitly places outside its scope.
The best computationally flavored proposal is to give an anonymous SDS a continuous society \(\mu\) and ask how decisive it can be subject to \(U\)-strategyproofness and efficiency. But in an atomless society one voter’s report leaves \(\mu\) unchanged, so unilateral strategyproofness holds vacuously for any such rule. A more meaningful repair lets a positive-mass group deviate. That is a coherent extension, and the paper’s same-preference group observation gives it some connection to the text. It nevertheless changes the strategic primitive and requires new choices about coalition mass and what computational problem to solve. It does not continue one of the paper’s results into a continuous computational question.
The honest limit of the negative case is that no one can rule out every worthwhile future extension. The case is strongest under ChoCo’s stated scope: this paper supports continuous axiomatic work and perhaps a new study of mass coalition manipulation, but it offers 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.