| paper | d4-journals-jet-2011-0008 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
The paper’s numbered results establish structural properties, characterizations, and inclusion relationships, but no computational result, so bit (a) fails. Footnote 12 suggests a sensible continuous-voter question, but its unnumbered, externally attributed hardness claim cannot anchor the mirror under the stated rule.
fails bit a — no named computational result to mirror
No qualifying computational result is covered. The candidate question concerns ME membership mentioned in unnumbered footnote 12; the numbered results concern structural properties, axioms, inclusions, and conjectural relationships.
There is no compliant numbered computational anchor in this paper. The numbered theorems and propositions establish structural properties of tournament solutions and stable sets; none classifies a problem as NP-hard, polynomial-time solvable, or otherwise. The closest candidate is unnumbered footnote 12, which says that deciding membership in the minimal extending set is NP-hard, citing Brandt et al. (2010). It is not a numbered result of this paper, and its placement follows inclusion claims that include a conjectural inclusion involving TEQ. I would not present it as a qualifying anchor.
The strongest plausible continuous question suggested by that footnote is Continuous Majority Minimal-Extending-Set Membership. An instance gives a candidate set \(C\), a finite list of strict-ranking types \(T\), rational masses \(\mu_t>0\) summing to \(1\), and a candidate \(c^\star\). Require that no pair of candidates is tied by the induced majority relation, defined by \(x\succ_\mu y\) when more than half the mass ranks \(x\) above \(y\). The question is whether \(c^\star\) belongs to \(\mathrm{ME}(T_\mu)\), using the paper’s definition of ME as the union of inclusion-minimal Banks-stable sets. A “yes” or “no” is the solution.
A plausible regime is a large electorate with many voters sharing a relatively small number \(\tau\) of complete ballots: the types are rankings, mass is the fraction of voters with each ranking, and the number of voters can greatly exceed \(\tau\). That is a natural population model for the paper’s majority-voting application. I would expect hardness to transfer if the cited membership-hardness result applies to these induced majority tournaments: normalized discrete ballot counts are already rational mass instances, and tournaments can be realized by majority profiles. The paper does not supply the needed named anchor for that argument.
The weakest point is therefore substantial: this mirror is plausible, but it is not anchored in a qualifying numbered result of the paper. Also, ME’s unique-minimal-stable-set interpretation remains conjectural in the paper; asking membership in its defined union avoids assuming uniqueness, but it may not be the interpretation a reader expects.
The strongest case against is that this paper supplies no numbered computational result to continuize. Its theorems concern structural properties of tournament solutions on abstract tournaments; they do not classify the complexity of an algorithmic problem. Footnote 12 is the sole candidate: it says that minimal-extending-set membership is NP-hard, but derives that claim from work by Brandt et al. and an inclusion chain involving the open TEQ conjecture. That is a weak anchor for a paper-level continuization.
The best repaired mirror is clear, though: give a society as rational masses over ranking types, induce its majority tournament, and ask whether a target candidate belongs to \(\mathrm{ME}\). That is a sensible high-multiplicity voting instance, and the paper’s majority-voting motivation makes it plausible the authors would recognize it. I can’t defeat it by appealing to known hardness, to the fact that the answer may be unchanged, or to the formal details of ties; those are not valid objections under the programme’s rules.
So the negative case establishes a narrower point: this paper lacks a strong named computational result to mirror. The continuous membership question could still be worthwhile as a new computational study of a population representation. I cannot honestly defend the universal claim that no worthwhile continuous mirror exists in any scenario.
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.