| paper | d4-conf-atal-2010-0085 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
Theorem 4 has a coherent population mirror: aggregate rational masses over complete labellings by per-argument plurality and check whether the result is legal. But no named result in the paper asserts an algorithm, a complexity bound, or hardness; the closest anchor is axiomatic. The mirror therefore fails the computational-result requirement.
fails bit a — no named computational result to mirror
The proposed mass formulation mirrors Theorem 4’s characterization of plurality rationality; the strategy-proofness, social-choice properties, and impossibility results remain property claims rather than computational questions.
I don’t see a qualifying computational anchor in this paper. Its named results are Theorems 1–4, all proved here: Theorem 1 says argument-wise plurality is strategy-proof for focal-set-oriented agents; Theorem 2 says it satisfies properties 1–7; Theorem 3 proves that no aggregation operator can satisfy universal domain, anonymity, systematicity, unanimity, and collective rationality together; and Theorem 4 characterizes exactly when plurality is collectively rational. None asserts a computational complexity result such as tractability or hardness. The paper’s central contribution is axiomatic, which the ChoCo scope excludes as an endpoint.
The strongest nearby continuous-population question would be: fix an argumentation framework \(AF=\langle A,\rightharpoonup\rangle\), and give a rational distribution \(\mu\) over its complete labellings. For each argument, aggregate the labels by their mass plurality, treating a tie as undefined. Is the resulting collective evaluation a legal labelling? A type is a complete legal labelling; mass is the fraction of agents holding it; the output is the per-argument plurality evaluation. A plausible regime is a very large consultation on a shared argument graph, where many participants fall into a relatively small number \(\tau\) of recurring evaluation patterns. Theorem 4, proved here, is the closest anchor: plurality is collectively rational exactly when the profile has no ties and satisfies Condorcet Defeat and Non-Condorcet Indecision.
That is a coherent high-multiplicity mirror of the paper’s plurality-rationality question. But its central question is whether an aggregation rule has a normative property, not the computational complexity of a problem the paper studies. Turning it into an algorithmic decision problem would be a natural extension, not a faithful computational mirror anchored in the paper’s results. The mirror’s weakest point is therefore decisive: although the population model is plausible, the paper offers no named computational result for it to mirror, and its central axiomatic result remains out of scope.
The strongest case against a ChoCo mirror is that this paper proves no computational result. Theorem 1 is a strategy-proofness claim; Theorem 2 lists social-choice properties; Theorem 3 is an impossibility theorem; and Theorem 4 characterizes when plurality is collectively rational. Their subject is the normative structure of aggregation, not the complexity of a computational problem. The exact mass version of Theorem 4 may be a sensible model, but it does not turn the paper’s contribution into the kind of complexity question the programme is meant to chart.
The proponent’s proposed setting is plausible: a large consultation on one argument graph, with recurring evaluation patterns. A type can be a complete legal labelling, and \(\mu_t\) its share of the population. For each argument \(\alpha\), the three label totals are \(p_\ell=\sum_{t:t(\alpha)=\ell}\mu_t\). That is a genuine continuous-population interpretation, and I would not reject it on high-multiplicity grounds.
But the best computational version of that mirror—compute the mass plurality and decide whether it is a legal labelling—is just a scan of the listed types and attack edges, polynomial in the explicit input size. Checking Theorem 4’s conditions is the same kind of calculation. The paper already defines the plurality rule and characterizes when it succeeds; the mass formulation adds no algorithmic obstacle or optimization problem. Since the masses are rational, any such distribution can also be scaled to an integer electorate with a common denominator. The result is a weighted restatement of the same aggregation calculation, not a new computational landscape. Harder variants, such as finding a nearby distribution that yields a rational outcome, would be new problems rather than mirrors of the paper’s results.
The other theorems offer no stronger computational anchor. Theorem 3’s impossibility carries directly to a distribution split between the two labellings used in its proof, but remains an axiomatic impossibility. Theorem 1’s individual strategy-proofness also loses its force in a nonatomic population: one person has zero mass and cannot change the outcome. Giving a positive mass bloc the power to deviate could make a meaningful model, but it changes the strategic agent and the question. Theorem 2’s properties likewise transfer as properties, not as complexity results.
So the negative case is strong on programme fit, not on whether a continuous population model can be written down. The proposed mass model is coherent, and the authors might well recognize it as their aggregation question. The weakness in claiming there is *no* worthwhile mirror in any scenario is precisely that this is a plausible one; what makes it a poor ChoCo target is that its closest computational question is immediate and adds little beyond the paper’s axiomatic analysis.
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.