| paper | d4-conf-atal-2005-0166 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 5 is computational, but its result is an anonymous distributed protocol with private voter inputs. The proposed mirror turns that into centralized arithmetic over already exposed type masses, changing the question and dropping the property the theorem establishes.
fails bit b-changes — the continuum limit changes the question
The continuous tally receives the type masses directly and has no protocol views or privacy guarantee for individual voters; the proponent acknowledges this gap but does not bridge it.
fatal: True
The proposed tally covers score-vector computation for the score-based schemes, but leaves out Theorem 5’s anonymity guarantee, its distributed communication bounds, and the other protocol results.
The strongest positive case I see is narrow: the paper has a clean high-multiplicity analogue for score aggregation, though that analogue does not preserve its full privacy question.
My anchor is Theorem 5, proved here. It says that every voting scheme considered in the paper has an anonymous protocol; except for STV, the protocols use a constant number of rounds and polynomial communication resources. For the score-based schemes—plurality, rejection, Borda, and approval—the protocol represents each ballot as a score vector, anonymously sums the vectors, and determines the winner from the resulting aggregate scores. This is a protocol-efficiency result, not an NP-hardness or standard complexity-class result.
The mirror I would put to a prover is Continuous Score Aggregation. An instance has \(m\) candidates, a scoring rule such as plurality or Borda, and a support \(T\) of \(\tau\) complete rankings with binary-rational masses \(\mu_t\geq 0\), where \(\sum_{t\in T}\mu_t=1\). The task is to output the exact score vector
\[
S_\mu(c)=\sum_{t\in T}\mu_t\,s(t,c)
\]
and its winning candidate or candidates. A solution is an exact algorithm with running time polynomial in \(m\), \(\tau\), and the input bit length \(L\). The score vector is the relevant output because it is exactly the aggregate computed by the score-based protocols in Theorem 5.
The natural regime is a large election with many repeated rankings: perhaps millions of voters but only a few hundred distinct ballots. Here a type is a complete ranking, and its mass is the fraction of voters with that ranking. That is a sensible high-multiplicity regime for score tallying; when nearly every ballot is unique, the mirror offers little compression. The continuous calculation is direct weighted aggregation, so I expect this problem to be tractable, with arithmetic polynomial in \(m,\tau,L\). A useful follow-up is to formalize how the discrete protocol’s communication bound relates to this compressed input: its stated polynomial bound is not already a bound independent of the number of voters.
This is a plausible mirror of the aggregation computation in Theorem 5: the paper’s protocol sums ballot contributions, and the continuous version sums type masses times their score vectors. It covers the score-based rows of that theorem, not STV or the paper’s impossibility results.
The weak point is substantial: Theorem 5’s contribution is an anonymous distributed protocol, whereas Continuous Score Aggregation, as stated, is a computational tallying problem on an aggregate input. The mirror captures what is being computed but not the original concern that voter-level inputs remain private during computation. I would not present it as a continuous version of the paper’s unconditional-full-privacy question. The positive case survives only as a focused mirror of its score-aggregation result.
Theorem 5 is the proponent’s only anchor, and the proposed mirror changes its computational object. The theorem gives anonymous distributed protocols: voters hold private ballots, exchange messages, and the protocol reveals an aggregate while satisfying a condition on what coalitions can learn. Continuous Score Aggregation instead gives an algorithm the type masses \(\mu_t\) and asks it to calculate \(\sum_t \mu_t s(t,c)\). That computes the same score vector, but it says nothing about a distributed protocol or privacy. The formula is shared; the result is not.
The best repair would make the masses private inputs and ask for a protocol that computes the scores while preserving an appropriate privacy guarantee. But if the parties are the original voters, there are still \(n\) participants, their private channels, and coalitions of named individuals. The distribution \(\mu\) does not capture those protocol views or communication costs. If instead each type is represented by one party holding its mass, the privacy unit changes: the protocol protects group masses, not individual ballots. Since a type includes a voter’s ranking, aggregating people into a party by type also assumes away the very individual ballot privacy the paper studies. A measure-valued protocol could be defined, but that would require a new model of participants, coalitions, and communication.
So the stated score-aggregation question is a tallying problem on an already aggregated input, not a continuous version of Theorem 5’s protocol result. A plausible nearby question is secure weighted aggregation among organizations that hold ballot-type masses. That could be useful, and the authors might recognize it as an application of distributed voting. Its privacy concern, though, is about aggregate holders and their masses, rather than the paper’s voters and their ballots. This is the strongest case against the anchor; it does not establish that no worthwhile related question can be formulated under any scenario.
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.