| paper | d4-journals-jet-2007-0106 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | no |
Theorem 2 gives an exact finite-electorate characterization, but its manipulation event is a profitable deviation by one voter. In a distributional society, that voter has zero mass; the proposed coalition threshold and prior-weighted exposure introduce a new deviation unit and objective that the authors would not recognize as the same problem.
fails bit b-changes — the continuum limit changes the question
The repair changes the unit from one voter to a positive-mass coalition and the objective from counting profiles to measuring societies under a chosen prior; the threshold, prior, and rule encoding are not determined by the paper.
fatal: True
The proposed construction targets Theorem 2's \(n>m\ge3\) characterization and minimum-count formula; Corollary 1 extends the characterization to unanimous rules, while the two-agent appendix and Theorem 3 are outside it.
The strongest positive lead is Theorem 2, proved in this paper. For \(n>m\ge3\), among anonymous, tops-only, surjective choice rules, the rules minimizing \(|M_f|\)—the number of preference profiles at which an individual can manipulate—are exactly the unanimity rules with a status quo \(u_a\). Such a rule selects \(a\) except when every voter ranks the same alternative \(x\) first, in which case it selects \(x\). The paper gives the minimum count as \(|M_{u_a}|=\frac12 n(m-1)(m-2)((m-1)!)^n\). Corollary 1 extends the characterization to unanimous rules, but adds no separate mirror.
There is a qualification: Theorem 2 is an exact optimization characterization, not a named complexity classification such as membership in P or NP-hardness. The paper contains no result of the latter kind, so it has no anchor that strictly meets the requested complexity-anchor criterion. Theorem 2 is the nearest substantive anchor for a positive case.
A plausible mirror would be \(\epsilon\)-Mass Manipulability Design. Take a fixed set \(A\) of \(m\) alternatives and full rankings \(T=L(A)\) as types. A society is \(\mu\in\Delta(T)\), with \(\mu_t\) the share holding ranking \(t\); its top-share vector is \(x_a=\sum_{t:\operatorname{top}(t)=a}\mu_t\). A rule \(g:\Delta(A)\to A\) depends only on those shares and satisfies \(g(e_a)=a\) for every alternative. To make rule design a finite computational problem, restrict \(g\) to rational polyhedral partitions with a stated cell and bit-size bound. Include in the instance a symmetric rational probability density \(\rho\) over \(\Delta(T)\), and a mass threshold \(\epsilon\).
Call \(\mu\) manipulable at scale \(\epsilon\) if some share \(\delta\le\epsilon\) of a type \(t\), with \(\delta\le\mu_t\), can report a different ranking \(t'\) and strictly prefer the resulting outcome:
\[
g\!\left(x+\delta(e_{\operatorname{top}(t')}-e_{\operatorname{top}(t)})\right)\succ_t g(x).
\]
The problem is to find a feasible rule \(g\) minimizing the \(\rho\)-mass of societies that are manipulable at this scale; a solution is the rule and its minimum exposure. This captures a plausible high-multiplicity regime: a very large electorate choosing among a fixed, modest number of alternatives, with many people sharing each of a relatively small set of rankings. Shares of voters are the natural units for that setting.
Theorem 2 suggests the conjecture that a status-quo unanimity rule minimizes small-\(\epsilon\) exposure. For fixed \(m\), I would expect a tractable geometric solution if that conjecture holds; with \(m\) and the rule-description bound as parameters, the design problem could instead be continuum-specifically hard. There is no discrete hardness result here from which to predict hardness transfer. The main follow-up questions are whether the conjecture holds for a natural choice of \(\rho\), whether its small-\(\epsilon\) exposure relates to the paper’s exact profile count, and how the answer depends on the distribution over societies.
The weakest point is the change in the unit of manipulation. In the paper, one individual changes their report; in a nonatomic society, an individual has zero mass and cannot change the outcome. The proposed mirror gives a cohort of identical voters a small mass, and replaces counting profiles with measuring societies under \(\rho\). That makes a meaningful continuous problem, but the paper’s theorem does not establish its answer. The measure \(\rho\) and the finite rule representation are also added modelling choices. The case for a mirror is therefore that Theorem 2 poses a natural least-manipulable-rule question in exactly the large-electorate regime continuization targets—not that its result already carries over.
Theorem 2 is the only substantial anchor, and it is a real extremal result. But it is not a computational result in the programme’s sense: it gives a characterization and a closed-form count, without an algorithmic problem or complexity classification. Its continuous analogue would need an additional design problem before it could become a computational mirror.
The large-election regime is plausible, and anonymity makes preference rankings natural types. The obstacle is the unit of manipulation. In a nonatomic society, one voter changing their report leaves the distribution \(\mu\) unchanged, so every rule \(g(\mu)\) has zero unilateral manipulability. The paper’s central quantity therefore disappears under a literal population limit.
The proposed repair—allowing a positive mass of voters to coordinate—defines a sensible coalition-manipulation problem. But fixing \(\epsilon>0\) makes the result depend on a coalition-size threshold, a prior \(\rho\) over societies, and a finite representation of the rule. None comes from the paper’s profile count. Sending \(\epsilon\) to zero restores the unilateral scale but makes manipulability live only in shrinking neighborhoods of outcome boundaries. For the status-quo rule, those neighborhoods lie around unanimous top-share vectors. Under a regular full-dimensional prior, their mass vanishes; meanwhile the paper’s count, divided by all preference profiles, is \(\frac{n(m-1)(m-2)}{2m^n}\), which also vanishes. Preserving a nonzero boundary coefficient would require a chosen rescaling or a special concentration of prior mass. That would be a singular asymptotic construction, not a canonical continuous-society version of the theorem.
One could study minimum coalition exposure as a new problem. That may be worthwhile on its own, but its answer would be driven by choices of \(\epsilon\), \(\rho\), and rule encoding that the original theorem does not address. The negative case is weakest there: the authors might recognize that adjacent design question. The stronger point is that the natural continuum limit erases unilateral manipulation, while the repair changes the object being measured.
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.