| paper | d4-journals-geb-2019-0123 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
Theorem 2 is a named structural result, but it does not state a computational result under the required test; the other named theorems characterize equilibria or welfare. A finite-support equilibrium-computation problem is plausible, but it would be a computational extension without a qualifying result of this paper to anchor it.
fails bit a — no named computational result to mirror
The candidate mirror concerns the equilibrium analysis behind Theorem 2 and the paper’s equilibrium characterizations; it leaves the welfare comparisons in Theorems 3–4 and the robustness extensions outside the computational question.
The positive case is narrow, and the anchor rule exposes its main weakness: the paper has no named computational-complexity result. It gives no algorithmic runtime, hardness classification, or parameterized result. Its theorems characterize equilibria and welfare. So there is no qualifying anchor in the requested sense.
The closest structural result is Theorem 2, proved in this paper. Under assumptions \((H1),(H1'),(H2),(H2')\), it says that a strategy profile is an equilibrium of the large-electorate game if and only if the parties’ and two critical voters’ strategies form an equilibrium of the simpler game in Section 3, with the remaining voters behaving as specified by Proposition 6. In that proposition, the extreme voters and specified conventional voters vote sincerely; conventional voters on the two sides of the median follow the vote of their respective critical voter; and, if the median voter is conventional, she votes for \(L\) or \(R\) with probability \(1/2\) each. The assumptions bound the size of the extreme-policy shift \(\bar d\) relative to the critical voters’ utility gains and losses from the conventional parties’ policies. This is a strong reduction of the equilibrium analysis, but it is not a theorem that equilibrium computation is in P.
If equilibrium-characterization results are accepted as computational anchors in a broader sense, that is the best one to use. A corresponding continuous question would be:
CPC Equilibrium over a Finite-Support Population. An instance gives a finite set of complete voter types \(T\), rational masses \(\mu_t\) summing to \(1\), and the paper’s three parties, policy space, utilities, perks, bargaining protocol, and public coordination signal. A type specifies all voter attributes relevant to the game: policy ideal point, stance on the extreme policy, sincere-vote party, strategic-voting cost, and utility function. Parties choose the same coalition-preclusion contracts as in the paper. Each individual casts one of the three ballots, while \(y_{t,k}\) records the mass of type \(t\) voting for party \(k\), with \(\sum_k y_{t,k}=\mu_t\). The task is to return the set of correlated sequential equilibria under the paper’s strong-Nash and subgame-perfection conditions, including contracts, vote masses, accepted offers, and resulting policies. The solution is an equilibrium correspondence, not a welfare-maximizing allocation.
A plausible regime is a large regional or national electorate with many voters in a modest number of preference clusters. For example, many voters may share a policy ideal point, the same stance on the discontinuous policy, and the same voting incentives. The population is then large relative to the support size \(\tau\). The type masses fractionalize aggregate vote shares while each person still casts an ordinary ballot; that co-modification is part of the population mirror. The parties and their contracts remain discrete.
This is recognizably the paper’s election problem: it preserves strategic voting, coalition preclusion, proportional representation, and government bargaining, while replacing named voters with mass by type. For the fixed three-party protocol and rational finite-support inputs, I would investigate Class A first: the paper’s critical-voter reduction suggests that aggregate voting behavior may admit a finite characterization. But Theorem 2 does not establish an efficient algorithm for the mass model. The concrete next questions are whether its critical-voter characterization survives positive type masses, and whether profitable coalition deviations can be checked efficiently from the type masses. If either fails, the continuous equilibrium problem could instead be hard for continuum-specific reasons. The paper gives no basis for claiming that discrete hardness transfers.
The weakest point is that Theorem 2 relies on critical individual voters in a finite electorate, whereas an atomless population has no individually pivotal voter. Repeated types also let positive mass act together, changing the granularity of strong-Nash deviations. The paper does say distinct ideal points are assumed for convenience, which helps the plausibility case, but it does not prove that its equilibrium correspondence survives this change.
So the conditional positive case is a well-motivated equilibrium-computation question anchored structurally in Theorem 2. Under the requested strict anchor rule, though, the paper supplies no named computational result to mirror.
The only anchor offered is Theorem 2, and it is not a computational result. It proves an equilibrium correspondence: under \((H1),(H1'),(H2),(H2')\), the large finite-electorate game reduces to the simpler game plus the behavior of the remaining voters. It gives no algorithm, complexity bound, or decision problem. Theorem 1 characterizes equilibria; Theorems 3 and 4 compare welfare. None supplies a computational problem whose complexity the continuous mirror could chart. Under the programme’s strict anchor rule, no anchor survives.
The strongest repair would be to define a new problem: given rational masses on finitely many complete voter types, rationally represented utilities and policy space, and the three-party protocol, compute the equilibrium correspondence or decide whether an equilibrium reaches a specified welfare level. But that requires choosing finite encodings and making the equilibrium output precise; the paper does not formulate those tasks. Theorem 2 may guide their analysis, but turning its equilibrium characterization into an algorithmic problem would be a new computational extension, not a mirror of a computational result in this paper.
There is a plausible population regime: the paper studies a large electorate, and many voters could share complete preference and incentive types. Its distinct-ideal-points assumption is described as convenient, not essential. So I cannot make a convincing case that no continuous population model would be sensible. The negative case is strong only at the narrower point the anchor rule makes decisive: this paper offers no named computational result to mirror. The broader claim that no worthwhile computational study could grow out of its model is weak.
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.