| paper | d4-journals-mss-2020-0005 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorems 1–5 characterize the Pareto correspondence through axiomatic conditions; none gives an algorithm, complexity result, or computational formulation. Evaluating Pareto optimality from a distribution over rankings is a statable computational task, but it is not a computational result of this paper, so no anchor satisfies bit (a).
fails bit a — no named computational result to mirror
Theorems 1–5 are axiomatic characterizations and have no computational mirror anchored in the paper.
I can’t make an anchored positive case from this paper: it contains no named computational result. Theorems 1–5 prove axiomatic characterizations of the Pareto correspondence for different numbers of alternatives. None asserts a complexity classification, gives an algorithm, or analyzes a computational formulation. So there are no qualifying anchors and no per-anchor continuous problems I can honestly claim the paper supports.
The closest natural computational query would take alternatives \(X\) and a distribution \(\mu\) over \(\tau\) strict rankings, then return the alternatives that are not Pareto dominated: \(x\) is excluded if some \(y\) is ranked above \(x\) by every positive-mass type. A large population with relatively few ballot types makes this a sensible continuous-population instance, and the query can be answered by checking pairs of alternatives against the support. But it is a new, straightforward evaluation problem, not a named result of the paper. The paper’s actual contribution is the axiomatic characterization; continuizing that contribution would continuize an axiomatic question, which the programme’s scope excludes.
The proponent raises no qualifying anchor, and the paper gives no result to anchor one to: Theorems 1–5 are axiomatic characterizations of the Pareto correspondence, not complexity results, algorithms, or computational formulations. A continuous restatement of those characterizations would still be an axiomatic question, which ChoCo puts out of scope.
The strongest computational rescue is to give a society as a distribution \(\mu\) over rankings and ask which alternatives are Pareto optimal. But an alternative is dominated exactly when some other alternative is preferred to it by every type in the support. The masses matter only through whether they are zero or positive. That makes the query a possible new computational task, but it does not mirror a result in this paper. A richer question—such as the minimum mass of preference changes needed to alter the Pareto set—would require adding an intervention model, costs, and an objective that the paper never proposes. It might be worthwhile on its own; it would be an extension, not a continuous mirror of these theorems.
So the negative case is strong for *this paper’s contribution*: no named computational result survives as an anchor. It is weaker as a universal claim that no related continuous computational project could ever be worthwhile. The paper does not establish that broader claim; it only gives little reason to take such a project from this paper.
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.