| paper | d4-journals-jet-2006-0063 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
No result in the paper meets the computational-result gate: Propositions 21–26 establish existence, genericity, and continuity properties, but state no algorithm, complexity bound, hardness result, or computational formulation used to compute. Proposition 22, the closest candidate, proves nonemptiness of the uncovered set; computing that set for finitely represented societies would require a new input model and a new computational question. The paper also already models voters as a measure space, so there is no discrete-to-continuous result to mirror.
fails bit a — no named computational result to mirror
No computational mirror covers the paper's results: Propositions 21–26 concern generic emptiness, nonemptiness, Pareto optimality, and continuity of the core, uncovered set, and undominated set.
I can’t make a rules-compliant positive case from this paper: it contains no numbered result asserting that a computational problem is in P, NP-hard, FPT, or otherwise classifying its complexity. Propositions 21–26 establish generic emptiness, nonemptiness, and continuity properties of choice sets. For example, Proposition 22 proves that the uncovered set is nonempty under stated topological assumptions; it gives no algorithm for computing that set. Those results cannot serve as the required computational anchors, so I can’t honestly state one continuous problem per anchor.
There is a plausible computational research opening here. The paper represents voters as a measure space with a preference profile, and explicitly includes continuous voter distributions. That makes a high-multiplicity scenario natural, but the population is already continuous in the paper. A new computational question about represented instances might be worthwhile; it would need its own input model and complexity result. It would not be a continuous mirror anchored in this paper’s named computational results.
The proponent raises no named result as an anchor: they identify Propositions 21–26 as mathematical results about choice sets, not complexity classifications. That leaves no anchor to defeat in the literal sense. The best candidate they point toward is Proposition 22’s nonemptiness result for the uncovered set, alongside the corresponding undominated-set and continuity results.
Those propositions do not define computational problems. They give existence or continuity guarantees, without an input encoding, an algorithm, or a running-time question. More fundamentally, the paper already models the electorate as a measure space with a measurable profile of voter preferences, and explicitly treats continuous voter distributions. Its main results therefore already concern a continuous population.
A stronger computational proposal could ask how to compute or approximate the uncovered set for a finitely represented society with rational type masses. That could be worthwhile work. But to make it a finite-input problem, one must add choices the paper leaves open: how alternatives and preferences are represented, how the winning-coalition rule is computed, and how the output set is encoded. Such a project would add computational structure to a model whose population is already continuous. The paper supplies no discrete computational result for that structure to mirror.
So the negative case is strong as a case against a continuous mirror of this paper: there is no computational result to mirror, and the population has already been continuized. Its limit is that it cannot rule out a valuable computational study built on the paper’s model. That would be a new computational project, rather than a mirror anchored in one 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.