| paper | d4-conf-atal-2021-0049 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The three named theorems establish strategyproofness properties, but none gives an algorithm, complexity bound, or computational formulation; they are axiomatic guarantees. Under population continuization, an individual has zero mass, while a positive-mass deviation asks about coalition manipulation instead. Bit (a) therefore fails.
fails bit a — no named computational result to mirror
None of the three named strategyproofness results yields a qualifying computational mirror; the paper's other results and supporting proof lemmas are also left without one.
I don’t find a qualifying computational anchor in this paper. Its numbered results concern strategyproofness, not whether a computational problem is in P, NP-hard, FPT, or otherwise tractable.
The closest results are proved here: Theorem 3.5 says Thiele methods on party-list profiles are immune to free-riding by agents with general Gärdenfors preferences. Theorem 4.1 says they are immune to superset and disjoint-set manipulation for every preference extension. Theorem 4.4 says they are fully strategyproof on party-list profiles for optimistic agents. These are substantial formal results, but they do not meet the requested anchor criterion. The paper’s references to computational complexity elsewhere are background claims, not numbered results of this paper.
A tempting continuous model would represent society as a distribution over approval sets and let some mass move from a truthful approval type to a misreport. But that makes the deviation a coordinated positive-mass group’s action. In a nonatomic population, a single voter has zero mass; allowing positive mass to deviate changes the paper’s individual manipulation question. I therefore can’t present that as an honest continuous mirror of one of its anchors. Under the stated requirements, there is no per-anchor continuous problem to hand to a prover.
The strongest case against a mirror is that this paper has no named computational result to mirror. Theorem 3.5, Theorem 4.1, and Theorem 4.4 establish strategyproofness properties; none classifies the complexity of a computational problem. One could define a manipulation search problem, but that would be a new framing, not a complexity result from this paper. The computational results mentioned in the related work do not supply an anchor either.
There is also a basic limit problem for all three theorems. Represent approval sets as types \(t\) with masses \(\mu_t\). A Thiele score for committee \(W\) is then
\[
S_\mu(W)=\sum_t \mu_t\sum_{r=1}^{|t\cap W|}w_r.
\]
A single voter has zero mass in a nonatomic society. Changing that voter’s report leaves \(\mu\), every committee score, and the winner set unchanged. So the continuous versions of free-riding in Theorem 3.5, superset or disjoint-set manipulation in Theorem 4.1, and unrestricted individual manipulation in Theorem 4.4 are all vacuous, regardless of the preference extension.
A more substantial proposal would let a positive mass \(\epsilon\) of voters coordinate on a false approval set, then ask how much mass is needed to improve the committee for that bloc. That is a coherent continuous question, and party-list electorates give it a plausible setting. But it changes the paper’s question from unilateral strategyproofness to coalition manipulation. Keeping one voter as an atom of fixed mass \(\epsilon\) has the same problem: that voter now has macroscopic influence. Sending \(\epsilon\) to zero restores the individual model only by making the deviation powerless, apart from boundary effects that require retaining finite-population information.
So the three named results share the same obstruction: their unit of deviation disappears under population continuization. Coalition or atom-size questions might be worthwhile in their own right, but this paper provides no computational result that makes them its continuous mirrors.
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.