| paper | d4-journals-jet-2016-0064 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Proposition 5 classifies when equilibria exist, and Proposition 1 states generic non-existence; neither asserts an algorithm, a complexity bound, or computational hardness. The paper already models a unit-mass electorate distributed over ideal policies by \(F\), while deciding equilibrium existence from an encoded \(F\) would add a computational task and input representation.
fails bit a — no named computational result to mirror
The paper studies equilibrium existence and characterizes equilibrium configurations, including robustness to voter-preference uncertainty and multiple-winner elections; it provides no computational algorithms or complexity results for those questions.
The strongest positive observation is that the paper already treats society as a continuum: it has unit mass of voters, distributed over ideal policies by \(F\). A voter’s type could be her ideal policy together with her voting behavior; mass is the population measure over those types. Candidates choose entry or a platform, seek to maximize their election probability, and the equilibrium question is whether those choices are mutually optimal. But that is the paper’s existing model, not a continuous mirror of it.
There are no eligible computational anchors. The named results are about equilibrium existence and characterization, not whether a computational problem is in P, NP-hard, FPT, or similar. For example, Proposition 5, proved in the paper, says that the set of admissible distributions permitting a symmetric two-location behaviorally robust equilibrium is non-degenerate if and only if \(k\ge2\). That is a substantive existence result, but it does not assert a computational complexity result. Proposition 1’s plurality claim is likewise about equilibrium existence and cites Osborne (1993).
One could propose a new algorithmic question: given a rational representation of \(F\) and \(k\), decide whether a behaviorally robust equilibrium exists, or compute a symmetric two-location one. But that would need a specified input representation and would be a new computational problem, not a mirror anchored in a named computational result of this paper. The paper’s continuous population is real; the requested computational anchor is absent.
The strongest objection is that the paper has no named computational result to mirror. Proposition 5 classifies when a symmetric two-location equilibrium exists for a non-degenerate class of distributions; Proposition 1 says plurality generically lacks an equilibrium. Both are claims about equilibrium existence, not computational complexity. The paper’s unit-mass electorate and continuous distribution \(F\) make society continuous already, but its question is analytic. Under ChoCo’s scope, that is not enough.
The best repair would turn Proposition 5 into an instance problem: given \(k\) and a finitely encoded distribution \(F\), decide whether a behaviorally robust equilibrium exists, or compute the locations and entrants in one. But the proposition’s central claim concerns a *set* of distributions being non-degenerate, not a finite input. The paper gives no encoding of arbitrary \(F\), and its definition quantifies over a continuum of functions. Choosing, say, rational piecewise-linear distributions would create a definite problem, but its complexity would depend on that added representation and would be an algorithmic extension of the paper, not a computational result the paper already poses.
Proposition 1 has the same problem: “almost every \(F\)” is a statement about a class of distributions, not a procedure for deciding equilibrium existence on encoded instances. One could define such a procedure for a restricted family of \(F\), but that would again require choices absent from the paper. The more computational version—searching for equilibria over the candidates’ continuous platform choices—also does not supply the missing population continuization: the paper already models a unit-mass electorate distributed over ideal policies.
That distinction does not prove that no useful algorithmic question can be built from this model. It does make the negative case strong: neither named result supplies a computational problem, and turning either into one requires adding an input model and a task. I would therefore reject these as ChoCo mirrors while leaving open whether a separately formulated algorithmic study of equilibrium computation is worthwhile.
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.