| paper | d4-conf-atal-2018-0404 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
The paper's named results prove representation, separability, and failure of separability, not an algorithm, complexity bound, hardness result, or computational formulation. A continuous-population version of separability could be an axiomatic extension, but it cannot supply the required computational anchor.
fails bit a — no named computational result to mirror
Theorem 3.10, Theorem 3.14, and Proposition 3.6 concern representation and separability; none provides a computational result for a continuous mirror.
I can’t identify a qualifying computational anchor in this paper. Theorem 3.10, proved here, shows that every sequential allocation rule can be represented as a scoring allocation rule with a specially constructed social welfare ordering. Theorem 3.14, also proved here, shows that sequential allocation rules are separable when their picking sequences are coherent. Proposition 3.6 proves that certain \(k\)-approval allocation correspondences fail even weak separability. These are results about representation and a structural property of allocation rules; none classifies the complexity of an underlying problem.
A continuous population of agents with shared preference rankings is conceivable for fair allocation, but using it to ask whether separability persists would continuize an axiomatic question. It would not mirror a computational result of this paper, and a new allocation model would be needed to make the question precise. The honest positive case is therefore weak: this paper offers plausible high-multiplicity settings, but no named computational result to anchor a ChoCo continuous mirror.
The proponent has no qualifying anchor, and that is the strongest case against a ChoCo mirror here. Theorem 3.10 is a representation result, Theorem 3.14 proves an axiomatic consistency property, and Proposition 3.6 gives counterexamples to that property. None classifies the complexity of a computational problem.
There are plausible high-multiplicity settings for allocation: large cohorts with shared rankings receiving goods supplied at a population scale. One could represent their outcomes by distributions over types and bundles, then ask whether separability extends to positive-mass subgroups. But that is an axiomatic extension of Theorem 3.14, not a computational mirror. Turning it into an optimization or complexity question would start a new project rather than continuize a computational result in this paper.
So I would not argue that continuous populations are inherently unsuitable for fair allocation. The narrower conclusion is that this paper offers no computational anchor for the programme. The proposed separability question may be worthwhile, but it falls outside ChoCo’s stated scope.
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.