| paper | d4-conf-atal-2009-0270 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorem 1 establishes a representation correspondence, Corollaries 1 and 2 transfer axiomatic impossibilities, and Theorem 2 characterizes dictatorship under systematicity. None states an algorithm, complexity bound, hardness result, or solver formulation used to compute, so bit (a) fails even though a continuous electorate model is plausible.
fails bit a — no named computational result to mirror
The proposed continuum covers the paper's general preference-aggregation setting, but none of its named results supplies a computational objective for that society.
The paper has no named computational result to anchor a continuous complexity mirror. Theorem 1 (Correspondence), proved here, translates total preorders into judgment sets on an implicative agenda while preserving their ordinal content. Corollaries 1 and 2 import Arrow’s and Sen’s impossibility results into that setting. Theorem 2, also proved here, says that for GD preferences on an agenda containing \(p,q,p\wedge q\) (or the stated alternatives), an aggregation function satisfies Systematicity if and only if it fails Non-dictatorship. These are correspondence and axiomatic impossibility results; none classifies an algorithmic problem as tractable or hard.
The strongest positive intuition is a large deliberative electorate. A type could be one complete GD preference over a fixed agenda, and \(\mu_t\) the fraction of the electorate with that preference. The collective decision would be a GD preference produced by an aggregation rule on these masses. That makes the population continuous in a plausible high-multiplicity regime, and the subject remains preference and judgment aggregation.
But this does not yield a valid anchored question under your criteria. The paper studies properties of aggregation functions over profiles, not a per-instance computational task with an objective. Moreover, \(\mu\) forgets individual identities, while Theorem 2’s dictatorship conclusion is about an individual; replacing it with a type- or measure-level notion of dictatorship would change the theorem’s question. The result is a possible direction for new work, not a mirror of a named computational result in this paper. I would not assign it to the tractable, hardness-transfer, or continuum-specific-hardness class.
The strongest objection is that the paper has no named computational result to mirror. Theorem 1 is a correspondence between representations of preferences and judgments; Corollaries 1 and 2 transfer axiomatic impossibility results; Theorem 2 characterizes when systematicity forces dictatorship. None asks for an algorithm, defines a computational input, or classifies complexity. A continuous-population version might be interesting, but it would not fill ChoCo’s computational gap for a result this paper establishes.
The proposed electorate of GD preference types is a sensible high-multiplicity model. But for Theorem 1, the translation applies separately to each preference: a distribution over preferences can simply be pushed through that translation. This lifts the correspondence to distributions without creating a computational question. One could add a specified rule, such as weighted majority, and ask whether its aggregate judgments form a GD preference. That is a coherent new problem, but the paper neither studies that rule’s computation nor makes such a test its result.
Theorem 2 is a harder anchor to rescue. Its conclusion concerns an individual dictator across profiles. In a measure-based society, a named individual has zero mass and cannot affect the aggregate. Replacing individual dictatorship with a decisive type or a positive-mass bloc might yield a sensible population axiom, but it changes the conclusion: it identifies a cohort, not the individual whose existence Theorem 2 characterizes. Including identity in types would preserve the distinction only by making the types effectively individuated, defeating the proposed high-multiplicity regime.
A computational task could be built around either theorem, but it would need a chosen aggregation rule, an input encoding, and a new algorithmic objective. That may lead to worthwhile research; it is not a continuous mirror of a computational problem in this paper. The negative case is strongest on this boundary: the paper offers a mathematical framework that could host future computational work, but no computational result for continuization to classify.
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.