| paper | d4-journals-mss-2021-0051 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
Theorem 3.1 is computationally meaningful, but its profiles are already distributions of mass over voter types, and it characterizes manipulation directly on that continuous model. Encoding those masses by their sparse support and stating the resulting runtime makes the existing characterization explicit; it does not create a new continuous mirror.
fails bit b-already — the paper is already native to the continuum
Theorem 3.1 covers maximal-coalition manipulation under scoring rules, and its inequalities are used in the paper's IAC simulations; this mirror does not cover the small-coalition variant in Corollary 3.5 as a separate question.
The strongest mirror is maximum-coalition manipulation in a large electorate with a small number of distinct ballots. Take a society with many voters but only \(\tau\) distinct complete rankings of \(m\) candidates. A type is a ranking, and its mass \(\mu_t\) is the fraction of the society holding it. For a target candidate \(A_k\), the eligible coalition is all mass whose members rank \(A_k\) above the sincere winner. The coalition may split that mass across reported rankings; everyone else keeps their ranking. The decision problem is whether some such reassignment makes \(A_k\) strictly win, with a successful mass reassignment as the solution.
My anchor is Theorem 3.1, proved in this paper. It says that, for any \(m\geq3\), scoring vector \(w_1\geq\cdots\geq w_m\), and profile whose sincere score order is \(A_1,\ldots,A_m\), that profile is manipulable by the maximal coalition for \(A_k\) exactly when the profile is normalized and nonnegative, has that initial order, and satisfies the strategic inequalities below. Let \(\mathfrak C_{A_k}\) be the eligible coalition’s mass, and let \(d(A_k,A_i)\) be the score advantage of \(A_k\) over \(A_i\) after coalition members put \(A_k\) first and before they fill their remaining ranks. Write \(M_s\) for the \(s\)-th largest of the \(m-1\) differences \(d(A_k,A_i)\). The strategic conditions are, for every \(q=0,\ldots,m-2\),
\[
\sum_{i\ne k}d(A_k,A_i)-\sum_{s=1}^{q}M_s
>
\left(\sum_{r=q+2}^{m}w_r\right)\mathfrak C_{A_k}.
\]
The paper’s Appendix A uses the theorem’s inequalities to test sampled profiles in its volume computations. This is a formulation anchor under the prompt’s exception for formulations used in computation; it is not a theorem stating a complexity class.
The scenario is a large public or membership election with a recurring ballot catalogue: millions of voters, perhaps hundreds of distinct rankings, and a modest number of candidates. The relevant comparison is \(N\gg\tau\), not a claim that every election is high-multiplicity. People sharing a ranking are indistinguishable for this problem, and manipulation by a fraction of the eligible coalition is a natural quantity at that scale. The authors should recognize the question readily: their paper defines normalized profiles as the \(n\to\infty\) limit and studies exactly these scoring rules and coalitions.
I expect this decision problem to be tractable in \(m,\tau\), and the input bit length \(L\). From the sparse support, compute the relevant score differences, sort the \(m-1\) values, and check the inequalities for each target. That takes polynomial time in the stated parameters; the theorem’s constructive proof also gives a way to turn a successful case into a mass-level manipulation. This is a Class A result, though the paper itself does not state a complexity bound in \(m,\tau,L\). The complexity-aware sparse-input formulation would make that bound explicit.
The scope here is narrow: maximum-coalition manipulation under positional scoring rules. The paper’s small-coalition variant in Corollary 3.5, its IAC probability calculations, and its Monte Carlo estimates are adjacent questions, but they are not needed for this mirror.
The soft spot is substantial: the paper has already made the population continuous and characterized this very manipulation question. That makes it unusually strong evidence that the regime is sensible, but also a likely novelty collision for a mirror that merely restates the decision problem. The remaining ChoCo contribution would have to be the explicit sparse-input computational treatment and its complexity accounting; Theorem 3.1 supplies an immediate tractability route rather than an unexplored hardness landscape.
Theorem 3.1 is a genuine anchor: it characterizes a computational decision—whether the maximal coalition can manipulate the election. Its inequalities already give a direct decision procedure. For each target \(A_k\), compute the coalition mass and the \(m-1\) differences \(d(A_k,A_i)\), sort those differences, and check the strategic inequalities. With a society given by \(\tau\) supported rankings and binary rational masses, these quantities can be computed using polynomially many operations in \(m\), \(\tau\), and the input bit length \(L\). There is no search over all \(m!\) rankings when the input is sparse, and no pricing problem remains to solve.
The larger issue is that the paper has already made the population continuous. It defines normalized profiles \(p\) as \(n\to\infty\), applies Theorem 3.1 to points in the profile simplex, and estimates the volume of manipulable regions under IAC. A large election with many voters sharing a modest catalogue of rankings is a sensible high-multiplicity regime, but it is already the regime of the theorem. Recasting its input as a support list parameterized by \(\tau\) changes the encoding and exposes a runtime bound; it does not create a new continuous society or a new manipulation question.
The strongest repair is to make the sparse-input complexity result explicit in \((m,\tau,L)\), perhaps also extracting a manipulation from a successful profile. That is a clean corollary of the characterization and its constructive proof. I would expect the authors to recognize it immediately, and that recognition reflects the collision: the paper has already characterized the same continuous problem. The paper’s Corollary 3.5 also covers fractional participation by smaller coalitions, so that variation does not open a fresh mirror.
The IAC volume calculation is a plausible adjacent computational project: exact or improved volume algorithms could go beyond the paper’s Monte Carlo estimates. It asks about a distribution over societies, though, rather than the manipulation decision for a given society that anchors this case. Adding costs or individualized campaign constraints could also produce harder models, but those changes supply new objectives and assumptions rather than a mirror of Theorem 3.1.
So the negative case against this anchor is strong: the proposed mirror is already modeled and characterized, and its sparse-input complexity bound appears immediate. The broader claim that no enriched scenario could yield worthwhile work is harder to defend; explicit complexity accounting or volume algorithms might be useful. I would not present that universal claim as established by this paper.
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.