| paper | d4-conf-aaai-2021-0524 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | no |
The paper’s main results concern unilateral manipulation, while the proposed continuous question asks how much mass from a type must coordinate to change the outcome. A nonatomic individual has zero effect on the majority tournament, so this coalition formulation changes the strategic question rather than mirroring the paper’s results. The constructive profile lemma is a possible computational foothold, but the proponent states no continuous analogue for it.
fails bit b-changes — the continuum limit changes the question
The proposed coalition question would study a new vulnerability problem; it does not cover Theorem 2’s unilateral impossibility or Theorem 3’s unilateral robustness guarantee. Theorem 1 is a supporting profile-construction result with no continuous question stated in the case.
The best honest positive case fails at the required anchors: this paper contains no named computational result classifying a problem as polynomial-time, NP-hard, fixed-parameter tractable, or otherwise. Theorem 2 may look like a candidate, but it characterizes weak resoluteness in terms of failure of robustness under every preference extension. Theorem 3 proves that the minimal extending set is robust under pessimistic extensions. Those are axiomatic results, not complexity results. Theorem 1 is a cited profile-construction result, not an algorithmic classification. So there is no qualifying anchor here, and I cannot honestly provide one continuous problem per anchor.
The nearest computational question I can make concrete is a new coalition-manipulation problem. Let types be strict rankings \(t\in L(A)\), with rational masses \(\mu_t\), and suppose their weighted majority relation has Condorcet winner \(a\). For a tournament solution \(F\) and preference extension \(e\), allow a positive mass of agents of one type \(t\) to redistribute their reports: \(x_{t,t'}\ge 0\), with \(\sum_{t'\ne t}x_{t,t'}\le\mu_t\). Ask whether such a redistribution can produce a tournament whose outcome \(F\) strictly improves on \(\{a\}\) for type \(t\) under \(e\), or minimize the mass required. This gives the population a genuine continuous role, and a plausible regime is a large electorate with many participants sharing each ranking.
But that is only an adjacent research question, not a strong mirror of the paper’s results. The paper studies a deviation by one agent; in a nonatomic population, one agent has zero mass and cannot change the majority relation. Replacing that deviation with a positive-mass coalition changes the strategic question, and none of the paper’s named results tells us how the new problem’s complexity should go. The paper therefore offers no sound hardness result whose dissolution in the continuum could be studied.
The proponent raised no qualifying anchor. Theorem 2 characterizes weak resoluteness through failure of robustness; Theorem 3 proves robustness for the minimal extending set under pessimistic preferences. Both are axiomatic results, not computational classifications. Theorem 1 is a profile construction. None supplies the complexity question the programme is meant to continuize.
The obvious obstacle is more specific than a lack of repeated ballots. Large electorates with recurring rankings are a sensible high-multiplicity regime. But this paper’s manipulation is by one voter, and its rules depend only on the majority tournament. In a nonatomic society, one voter has measure zero and cannot change that tournament. In finite electorates, a switch changes any normalized pairwise margin by at most \(2/n\). If the limiting margins are strictly away from zero, then for large \(n\) no single switch can alter any edge; the robustness question becomes trivial. When an edge is close enough to a tie for one vote to matter, the relevant \(1/n\)-scale margin disappears in the continuous distribution, while exact ties require a convention the paper avoids by using odd electorates. Recovering those cases means retaining finite granularity.
The strongest repair is the proponent’s coalition version: find the least positive mass that can change the tournament and produce an outcome preferred by that mass under an extension \(e\). That is a coherent continuous-population problem, and it could be worth studying in its own right. But it changes the strategic unit from one voter to a coordinated group. Neither Theorem 2’s one-agent impossibility nor Theorem 3’s one-agent guarantee answers it. It would be a new coalition-vulnerability project, without a named computational result in this paper to anchor the mirror.
So the negative case is strong for this paper as evidence for ChoCo: its main results and its unilateral manipulation question do not carry over as informative continuous computational questions. The universal claim is weaker. A carefully framed coalition problem could still be worthwhile; the paper alone does not make that case.
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.