| paper | d4-conf-aaai-2007-0304 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper’s numbered results establish properties of voting rules, not algorithms, computational formulations, or complexity bounds. Its claim that sequential composition is computationally economical is motivation without a stated computational guarantee. The opponent correctly explains that computing a mass-weighted outcome would be a new problem, not a continuous analogue of one of these results.
fails bit a — no named computational result to mirror
No result is covered by a continuous computational mirror; the named results raised here concern neutrality and near-neutrality.
I can’t make an honest positive case anchored in this paper’s named results. It contains no numbered theorem, lemma, corollary, or proposition establishing a computational complexity result such as membership in P, NP-hardness, or fixed-parameter tractability. The introduction calls sequential composition “computationally economical,” but the paper does not analyze its complexity.
The tempting anchors are axiomatic results: Theorem 3 proves neutrality for the order-independent composition of two binary plurality correspondences; Theorem 12 proves near-neutrality for sequential compositions of neutral local correspondences; and Theorem 14 proves near-neutrality for the order-independent composition under an additional condition on equal-sized domains. They do not qualify as computational anchors, and continuizing those neutrality questions would be outside ChoCo’s stated scope.
A plausible population story exists: repeated multiattribute referenda could have a distribution \(\mu\) over complete preference types represented by legal rankings or CP-nets. But the paper supplies no computational decision problem on that population to mirror. Its finite-profile notion of “nearly representative” also has no immediate continuous counterpart. So there is no lead mirror question per the requested criteria; inventing one would attach a new computational problem to the paper rather than continuize one of its results.
The paper has no computational result to continuize. Its numbered theorems concern properties of voting rules, permutations of legal profiles, and decomposability; none classifies the complexity of a decision, search, or optimization problem. The introduction’s claim that sequential composition is “computationally economical” is motivation, not a complexity analysis.
The strongest candidates still fail as anchors. Theorem 3 establishes neutrality for a composition of two binary plurality correspondences; Theorems 12 and 14 establish near-neutrality under their stated conditions. These are axiomatic claims. A population distribution over complete preference types for repeated referenda could be sensible, but asking whether neutrality or near-neutrality survives there would continuize an axiomatic question, outside ChoCo’s scope. The other decomposition and permutation results have the same problem.
One could define a new problem—say, computing the outcome of a mass-weighted sequential composition from a rational distribution over legal types. But that would need its own rule, input representation, and complexity question. It would be an algorithmic extension inspired by the paper, not a mirror of any result in it. The negative case is strong on that distinction; it cannot rule out the value of such an independent extension, only say that this paper supplies no eligible anchor for a continuous 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.