| paper | d4-journals-mss-2019-0024 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
The weighted-margin version \(H_{\mathrm{cont}}\) is a recognizable continuous analogue of the paper’s central axiom system. But Proposition 3.2 and Corollary 3.8 establish axiomatic properties and maximality, not a computational result, so no anchor meets the computational gate.
fails bit a — no named computational result to mirror
The proposed analogue covers the Condorcet Consistency, Top Property, and Bottom Property claims and the maximality of \(H\); it does not cover the selection results in Section 4, and none of these results is computational.
I can’t supply a qualifying computational anchor: the paper has no numbered result asserting that a computational problem is in P, hard, FPT, or otherwise classified. Its results concern axioms and voting rules. For example, Proposition 3.2 says the Minimax Rule satisfies Condorcet Consistency, the Top Property, and the Bottom Property; the paper includes a proof, while noting this result was already known. Corollary 3.8 says every voting correspondence satisfying those three properties is contained in \(H\); this characterization is proved in the paper. Neither is a computational result, so neither can honestly anchor the requested case.
There is a natural population-continuum version of the paper’s subject. Let a type be a strict ranking \(t\in T\), and let \(\mu_t\) be its share of a large electorate. A plausible regime is a national election with many voters but relatively few distinct ballots, so the support size \(\tau\) is much smaller than the population. A voting correspondence would return a nonempty set \(W(\mu)\subseteq A\). One could translate the paper’s participation conditions into cohort conditions: if \(x\in W(\mu)\), it remains selected after adding any positive mass \(q\) of voters who rank \(x\) first; if \(x\notin W(\mu)\), it remains excluded after adding mass \(q\) who rank \(x\) last. Writing \(\mu'=(\mu+q\delta_R)/(1+q)\) makes the change in population explicit.
The closest formal mirror of the paper’s main result is a continuous analogue of \(H\). Define
\[
d_{xy}(\mu)=\sum_{t\in T}\mu_t\bigl(\mathbf 1[x\succ_t y]-\mathbf 1[y\succ_t x]\bigr),
\qquad
r_x(\mu)=\max_{y\ne x}d_{yx}(\mu),
\]
and set
\[
H_{\mathrm{cont}}(\mu)=
\{x\in A:\ \forall y\in A,\ r_y(\mu)<r_x(\mu)
\Rightarrow d_{yx}(\mu)<r_y(\mu)\}.
\]
The output is a set of alternatives, with no optimization objective. The formula is directly recognizable as the paper’s definition of \(H\) with weighted pairwise margins. The paper’s maximality argument appears adaptable to rational masses, but that would be an extension of its axiomatic result, not a computational result it establishes. Evaluating this formula from a \(\tau\)-type input also looks straightforward; that observation is not an anchor either.
The weakest point is decisive for ChoCo’s purpose: the plausible mirror continuizes the population, but its substance remains an axiomatic characterization. The paper does not study the complexity of an intervention, an algorithmic decision problem, or a hardness result that could dissolve or persist in the continuous setting. So there is a credible continuous analogue of what the paper studies, but no honest case here that meets the programme’s computational-anchor requirement.
The strongest case against a ChoCo mirror is that the paper has no computational result to continue. Proposition 3.2 establishes that Minimax satisfies three axioms, and Corollary 3.8 characterizes the maximal correspondence satisfying them. The later results concern selections and axiomatic properties too. None formulates an algorithmic problem or classifies its complexity.
The proponent’s \(H_{\mathrm{cont}}\) is a credible population-continuous version of the paper’s central construction. With \(d_{xy}(\mu)\) and \(r_x(\mu)\) defined from ranking masses, it translates the condition defining \(H\) into weighted margins. Grant that this is a sensible object, and that the maximality argument might extend. Its result would still be an axiomatic characterization over a continuous society. Continuizing the population meets one half of ChoCo’s scope; the paper supplies no computational question for the other half.
The strongest computational extension would be to ask how much mass must be added or moved to change a winner, or how to find a robust selection from \(H_{\mathrm{cont}}\). Those could be worthwhile questions, but they need a specified rule or selection, an intervention model, and often costs or a target. The paper supplies no such optimization problem. Adding those ingredients would start a new agenda rather than mirror one of its results. Turning the paper’s open problem about characterizing selections into an algorithmic task also requires a finite representation of the rule class, which the paper does not provide.
A large electorate with relatively few ranking types is a plausible high-multiplicity regime, and \(H_{\mathrm{cont}}\) should not be dismissed as an invalid limit. The negative case is narrower: under ChoCo’s computational gate, this paper offers no qualifying anchor. That does not prove no useful computational project could grow from it; it does mean the project would need a new problem, not a continuous mirror of the paper’s 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.