| paper | d4-journals-geb-2003-0011 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
Claim 2 establishes uniqueness, not a computational result of the kind required for an anchor, and Proposition 1 establishes existence without a construction or complexity claim. The proposed equilibrium-computation task is statable, but the paper already models society using type shares \(q_i\), so that task does not create a continuous-population mirror.
fails bit a — no named computational result to mirror
No result supplies an eligible computational anchor; the proposed computation concerns the sampling equilibrium already defined by the paper’s type shares and action distributions.
The strongest positive case is the paper’s voting scenario. A type is a voter’s preference type—\(L\), \(M\), or \(R\), with \(ML\) and \(MR\) in the extension—and its mass is its population share \(q_i\). The action distribution \(p_i\) records how voters of that type vote. A large electorate with three or four preference types is a plausible high-multiplicity regime: many voters, few distinct types, and types that share the preferences and response rules relevant to the model. The authors would readily recognize this as their problem.
The nearest computational question would be Sampling-Equilibrium Winner: given rational shares \(q_L,q_M,q_R\), the paper’s \(k=2\), no-abstention response rules, and \(q_M<1\), compute the equilibrium action distributions and the plurality winner. A solution is a profile \(p\) satisfying the paper’s sampling-equilibrium fixed-point conditions, together with the candidate maximizing the resulting vote share. The paper proves uniqueness for this case in Claim 2, so this is a well-defined problem. For this fixed three-type setting, its equations suggest a tractable computation.
But I cannot offer that as an eligible continuous mirror under your anchor requirement. The paper already describes society by type proportions \(q_i\) and action distributions \(p_i\). The proposed problem computes an equilibrium in the paper’s existing population model; it does not continuize a discrete problem. That makes the tempting mirror a restatement of the model.
There is also no qualifying computational anchor. Proposition 1, proved here using Brouwer’s theorem, says a sampling equilibrium exists for the general model. Claim 2, also proved here, says the specified voting model has a unique equilibrium. Claims 3 and 4 give voting properties, including bounds on strategic voting and the absence of strategic voting when \(q_M=0\) and \(k=2\). These are existence, uniqueness, and equilibrium-analysis results; none asserts a complexity classification such as polynomial-time solvability or NP-hardness. So the honest positive case is that this is an exceptionally natural high-multiplicity setting. Its weakness is decisive for this assignment: the paper already uses the continuous population object, and it supplies no named computational result to mirror.
Claim 2 is the proponent’s only anchor, and its proposed “Sampling-Equilibrium Winner” adds computation to a model that is already continuous in the population. The paper gives each type a population share \(q_i\), represents type \(i\)’s behavior by an action distribution \(p_i\), and states its equilibrium conditions in those quantities. There is no finite electorate in the paper whose computational problem Claim 2 relaxes. Asking an algorithm to compute \(p\) from rational \(q\) could be a useful follow-up, but it computationalizes the paper’s existing population model; it does not continuize it.
The other obvious anchors do not supply a missing bridge. Proposition 1 proves existence, Claim 2 proves uniqueness, and Claims 3 and 4 give properties of equilibria. None states a computational result. One could ask for the smallest change in population shares that makes \(M\) win, using Claim 3 or Figure 1 as the starting point. That is a question about the same continuous simplex the paper already studies. Generalizing to more types or larger samples might create a substantial equilibrium-computation problem, but it would extend the model rather than mirror a discrete result in this paper.
A finite-electorate version can be constructed, with type counts and samples drawn without replacement. Its large-population limit may recover the paper’s sampling model. But that supplies a discrete counterpart after the fact; it does not turn the paper’s existence, uniqueness, or equilibrium-property results into discrete computational results awaiting continuization.
This is a strong case against a ChoCo mirror of this paper, though it cannot show that computational work on richer sampling-equilibrium models would be worthless. The problem is that the paper has already made the population continuous, while leaving no named computational result to carry across the bridge.
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.