| paper | d4-journals-geb-2017-0002 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper’s numbered propositions establish equilibrium existence and stability or derive voter behavior; they do not claim an algorithm, a complexity bound, or hardness for a computational problem. The experimental results report observed behavior without a computational guarantee. Thus no named result supplies the required computational anchor.
fails bit a — no named computational result to mirror
No named computational result is covered; the propositions concern equilibrium existence and stability, and the experiment reports voter behavior.
The paper contains no named computational result to anchor a continuous mirror. Its numbered propositions concern equilibrium existence, stability and voter behavior; they do not establish that a computational problem is in P, NP-hard, FPT, or similar. I can’t present one of them as an algorithmic result without changing what it says.
There is a plausible high-multiplicity regime behind the paper: a large election with many voters but relatively few preference types. One could represent the electorate by masses \(\mu_t\), with type-level ballot choices or voting probabilities as the decision variables. But the paper’s central mechanism depends on whether an individual vote can be pivotal. In a straightforward atomless model, a single voter has no effect on the outcome, so that mechanism changes. Preserving it would require a more careful population-uncertainty model.
That makes this a plausible direction for a new computational question, but not a mirror anchored in this paper’s named results. There are no qualifying anchors here, so there is no per-anchor continuous problem to state.
The proponent raises no qualifying anchor: the paper has no theorem about the complexity of a computational problem. Its numbered results characterize equilibrium existence and stability and derive voter behavior. The closest candidates for a mirror are Proposition 2, on sincere-equilibrium existence under aggregate uncertainty, and the large-election results on stable equilibria. Turning those into equilibrium-search or equilibrium-classification problems would be a new computational question, not a computational result the paper establishes.
There is also a deeper obstacle to those candidate mirrors. In the paper, an individual’s ballot matters because it can be pivotal in a finite election. In an atomless society, one voter has mass zero, so changing that voter’s ballot cannot change the aggregate outcome. If voters know the type masses, the uncertainty over realized counts disappears too. The sincerity and stability comparisons the paper studies then lose their mechanism. Letting whole type masses change together could restore an effect on the outcome, but that models coordinated blocs, not the paper’s unilateral voter deviations.
One could try to preserve pivotality by retaining a discrete stochastic electorate—for example, by keeping random vote counts around the type proportions. But then pivotality comes from the finite count lottery, rather than from a continuous society of masses. That may motivate a new computational study, but it replaces the paper’s central object and does not provide a continuous mirror of its equilibrium results. Likewise, a complexity project with growing numbers of candidates or voter types would require generalizing the paper’s fixed three-candidate setup.
The large-electorate setting is a plausible high-multiplicity regime; that supports the regime rather than counting against it. It does not supply the missing computational problem, and multiplicity does not remove the pivotality issue. So the strongest negative verdict is that this paper offers no worthwhile paper-grounded continuous computational mirror. The universal claim is less secure: a stochastic voting model built around a type distribution might be worth studying on its own, but it would be a new project rather than a continuization of these results.
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.