| paper | d4-journals-geb-2019-0087 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 1 and the supporting lemmas establish equilibrium existence, including through a fixed-point argument, but do not state a computational result. Computing equilibria from a type distribution would be a new problem, not a computational mirror anchored in a result of this paper.
fails bit a — no named computational result to mirror
No result is covered by a continuous computational mirror; the paper's named results concern equilibrium existence and strategic voting behavior.
I don’t find a qualifying computational anchor in this paper. Its nearest named result is Theorem 1, proved here: it states that in large plurality elections, Duvergerian equilibria—with two policies receiving positive vote shares and substantial strategic voting—exist both with costless or compulsory voting and with voluntary, costly voting. That is an equilibrium-existence result, not a result classifying a problem as tractable, hard, or parameterized.
A follow-on question could ask how to compute equilibria from a distribution of voter types, with strategies specifying whether each type abstains or votes for a policy. But that would be a new computational question, not a continuous mirror anchored in a computational result of this paper.
The paper already studies a Poisson-sized population whose voters’ preferences and costs are drawn from distributions. Its contribution is analytic: proving equilibrium existence and characterizing strategic voting in large societies. Under the requested anchor criterion, there is no honest positive case to make.
The only named result that could anchor a mirror is Theorem 1, but it proves equilibrium existence; it does not classify the complexity of a computational problem. Lemma 1 likewise gets existence from a fixed point. One could propose computing an equilibrium from a distribution of voter types, but that is a new computational question, not a continuous version of a result this paper establishes.
The best version of that proposal would keep each voter’s full type—preferences and voting cost—and ask for equilibrium turnout and voting strategies. But in a deterministic nonatomic population, an individual has zero mass and cannot change the plurality winner. Voting therefore brings no instrumental benefit, while almost every voter has a strictly positive cost. Almost everyone abstains, and the pivotal incentives behind Theorem 1 disappear. Grouping voters into positive-mass blocs could restore influence, but then blocs act as strategic players; that changes the paper’s individual-voter game.
One could instead retain Poisson uncertainty so individual votes can still be pivotal. That preserves the interesting incentives, but it also preserves the paper’s stochastic finite-population model. The paper already specifies distributions over preferences and costs and studies the large-\(n\) behavior; describing the game by its type distribution does not supply a new computational result.
So the negative case is strongest on the paper’s actual contribution: there is no computational theorem to mirror, and the natural deterministic population mirror loses the mechanism the theorem studies. I cannot rule out a worthwhile, separate project on computing equilibria in these games. But that possibility does not make this paper’s equilibrium-existence result a continuous computational mirror.
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.