| paper | d4-journals-mss-2005-0008 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Neither named result asserts that an object can be computed or that computing it is hard. With no computational result to anchor a mirror, the paper supplies no continuous problem to grade.
fails bit a — no named computational result to mirror
None: Theorem 7 is an axiomatic characterization and Theorem 8 establishes axiom independence; neither is covered by a continuous computational mirror.
I can’t make a defensible ChoCo-positive case from this paper: it contains no named computational result to anchor one. The nearest numbered result is Theorem 7, proved in the paper: an ordering \(\succeq\) on \(2^X\) satisfies Dominance, Independence, Robustness, and Indifference if and only if it is the paper’s extended leximax ordering \(\succeq_L\). Theorem 8, also proved here, says those four axioms are independent. Both are axiomatic results; neither asserts a complexity classification or gives an algorithmic result.
The paper’s object is one decision maker’s ranking of opportunity sets \(A,B\subseteq X\), where \(X\subseteq\mathbb{R}^n\). Its infinite or continuous element is the space of alternatives and the sets being compared. There is no population of agents, distribution over voter types, mass-transfer decision, or computational objective. Treating the opportunity sets as types or their elements as population mass would change the problem the authors study.
One could propose a separate complexity question about computing \(\succeq_L\) from finite encodings of opportunity sets and utilities. But the paper supplies neither that input model nor a named complexity result to mirror; it would be a new computational project, and it still would not continuize the population. So there is no precise continuous problem per valid anchor to hand to a prover. The paper’s axiomatic continuization is outside ChoCo’s scope.
The strongest case against a ChoCo mirror is that this paper has no computational result to anchor one. Theorem 7 characterizes the leximax ordering on opportunity sets by four axioms; Theorem 8 shows those axioms are independent. Neither states a complexity result or defines an algorithmic problem. The paper’s continuum is in the space of alternatives and the opportunity sets being compared, not in a population of agents.
A possible repair would be to ask for the complexity of deciding whether \(A \succeq_L B\). But the paper gives no input representation for \(A\), \(B\), or the utility function. For finite encoded sets, comparison may be straightforward; for infinite sets, the answer would depend on a representation chosen for a new problem. Another repair would introduce many consumers, group them by complete utility and opportunity-set type, and ask how mass transfers affect an aggregate objective. That could be a sensible high-multiplicity consumer-choice project, but it adds the population, objective, and computational task that the paper does not study. It would not mirror Theorem 7. Treating alternatives inside one opportunity set as population types would instead move continuity to the option space and risk changing the leximax criterion’s account of the number and ranking of options.
So the negative case is strong for this paper: there is no named computational result for a continuous population to mirror. Its limit is the universal claim. A worthwhile population-computation project could be built around consumer choice, but the paper supplies no result that would make it this paper’s mirror.
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.