| paper | d4-conf-aaai-2015-0191 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
Theorem 11 gives a finite-population termination guarantee, but the paper itself formulates its main model over a distribution of voter types and proves non-atomic convergence in Theorem 5. The proposed mirror therefore restates a continuous-population result already in the paper, leaving no discrete-to-continuous bridge for this anchor.
fails bit b-already — the paper is already native to the continuum
The proposed question covers weak local-dominance convergence, already treated by Theorems 11 and 5; it leaves the worst-case-regret results and input-sensitive complexity of equilibrium finding aside.
The strongest honest case is the paper’s local-dominance dynamics, not its regret-minimization results. Its anchor is Theorem 11 in Appendix VIII, proved in this paper: for a finite population, any sequence of singleton weak local-dominance moves is finite. The paper’s Theorem 5, also proved here, gives the continuous counterpart: with its fixed move granularity, every sequence of weak local-dominance moves in the non-atomic model is finite, even with mixed uncertainty levels, arbitrary starting states, and moves by arbitrary subsets of voters. That extends the move model as well as changing the population representation.
A precise mirror problem is Weak-LD Mass-Dynamics Termination\(_\infty\). An instance has candidates \(M\), a finite support \(T\) of voter types, rational masses \(\mu_t\) summing to \(1\), and an initial vote allocation \(x_{t,c}\). A type is a complete tuple of the ranking \(Q_t\), uncertainty level \(r_t\), and weak local-dominance behavior. Each allocation satisfies \(\sum_c x_{t,c}=\mu_t\). Use the paper’s Plurality scores, uncertainty sets, and tie-breaking convention, and fix a granularity \(\varepsilon\) dividing every \(\mu_t\). A legal step moves any chosen \(\varepsilon\)-sized cohorts to actions allowed by their weak-LD response to the current scores. The task is to produce a finite legal path ending at an equilibrium, where every cohort’s current vote is its only allowed response. There is no optimization objective: the question is whether the dynamics reaches a state with no permitted move. Theorem 5 guarantees that every legal path terminates.
The natural regime is a large election whose voters fall into relatively few cohorts sharing a complete ranking and uncertainty level: for example, voters who respond to the same kind of poll information and have similar confidence in it. The number of people can be far larger than the number of supported types. The \(\varepsilon\) restriction matters: the paper notes that without bounded granularity, infinite acyclic paths can occur.
I would tentatively expect the equilibrium-finding problem to be Class A, because the paper proves structural termination for this broad mass-dynamics model. That is a prediction, not a polynomial-time result: Theorem 5 gives no bound on path length in \(m\), \(\tau\), the encoding length, or \(\varepsilon\). Bounding the number of moves, and finding an equilibrium efficiently, are the main follow-up questions.
The scope is deliberately narrow: Plurality and weak local-dominance convergence. It does not cover the regret-minimization results or establish a continuous complexity classification for them.
The weak point is substantial: this paper already formulates and proves the non-atomic result. The mirror is real—the finite Theorem 11 and continuous Theorem 5 concern distinct move models, and the latter handles simultaneous mass moves—but it is not an unaddressed continuous question. Also, these are dynamics results, not the usual NP-hardness or polynomial-time classifications ChoCo seeks. The positive case is therefore strongest as evidence that a high-multiplicity dynamics problem is well-posed and meaningful, not as a claim of new complexity terrain.
The proposed mirror is already in the paper. Section 1.1 explicitly makes the population non-atomic: voters are a distribution over types, and votes are allocated as masses. Theorem 5 proves that every sequence of weak local-dominance moves terminates in that model, including moves by arbitrary subsets. The proposed input, legal steps, and termination claim restate that result. This is a genuine collision under ChoCo’s standard: the society itself is already continuous in the paper.
The finite-population Theorem 11 does not rescue the mirror. Its singleton-move result and Theorem 5’s non-atomic, group-move result are both proved here. Nor does the paper leave a hidden convergence-rate question for a new mirror: Section 6.1 already asks how many times a voter can move and conjectures a polynomial bound.
There is a real computational gap: neither theorem gives an input-sensitive runtime bound or a polynomial-time equilibrium-finding algorithm. One could study those questions, but that would be complexity work on a model the paper has already continuized, not a new continuous mirror of its result. Removing the move granularity does not preserve the proposed termination claim; Appendix IX gives infinite acyclic paths. Keeping granularity makes the question well-defined, but returns to the paper’s model.
So the negative case is strong for this anchor: it offers no unaddressed continuization. The broader claim that no worthwhile follow-up exists is weaker. Efficient equilibrium computation could be worth studying, though its value would come from complexity analysis, not from introducing a continuous population.
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.