| paper | d4-journals-mss-2007-0045 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 1 establishes equivalence between two ways of defining a ranking over \(2^X\); it makes no claim about computing a solution or the complexity of a computational problem. Asking for population fractions or adding an election would introduce a new aggregation or collective-choice problem, not mirror a computational result in this paper.
fails bit a — no named computational result to mirror
The paper's sole numbered result, Theorem 1, proves equivalence of the two infinite-case leximax relations; no computational result remains to mirror.
There is no honest computational anchor in this paper. Its only numbered theorem, Theorem 1 (proved here), says that the two extensions of leximax to \(2^X\)—Arlegi et al.’s procedural rule \(\succeq_L\) and Ballester and De Miguel’s rule \(\succeq_L^*\), which compares every finite subset of one set with some finite subset of the other—coincide for every pair of sets. That is an equivalence result about preference relations, not a result that a problem is tractable, hard, or belongs to a parameterized complexity class.
One could imagine a population of decision makers grouped by complete preference type, with \(\mu_t\) the fraction of each type, and ask what fraction prefers one opportunity set to another. But that adds a population and an aggregation question absent from the paper. Applying Theorem 1 separately to each type would merely carry its equivalence over type by type; it would not mirror a computational problem the authors studied.
The paper’s infinite opportunity sets make the *choice-set* side infinite. They do not make the society continuous. So the strongest honest conclusion for ChoCo is that this paper supplies no qualifying anchor and no continuous problem to hand to a prover as its mirror. That is the weak point of any positive case here—and it is decisive under the programme’s scope and anchor requirements.
The appended “CASE FOR” is labeled as the proponent’s case, but its substance argues that there is no continuous mirror. Taking its sole candidate, Theorem 1, the strongest case against a mirror starts with what the theorem does: it proves that two definitions of an individual preference over opportunity sets give the same ordering. The paper states no computational problem and proves no complexity, algorithmic, or approximation result. There is therefore no computational result here whose population-continuous counterpart could be a ChoCo mirror.
A natural population story is available: many people with different preference types assess the same two opportunity sets, and we ask what fraction prefers each. But that adds an aggregation question. The theorem applies separately to each type; it says nothing about the population statistic. A stronger proposal would treat opportunity sets as candidates, use each person’s leximax ordering as their ballot, and study bribery or control. That is a coherent computational problem, but it adds an election and a collective choice rule absent from the paper. It is a downstream application of leximax, not a continuization of a result this paper establishes.
So the negative case rests on a scope gap, not on a claim that no repeated population could be imagined. A continuous population can be sensibly attached to the rule; the paper itself supplies no computational question for that population to answer. The limitation is that this supports rejecting the paper as a ChoCo mirror, rather than proving that no worthwhile research could ever build on its rule.
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.