| paper | d4-conf-ecai-2020-0177 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
None of the named results asserts an algorithm, complexity classification, or computational formulation used to compute. A continuum of decision-maker types could motivate new axiomatic aggregation work, but it cannot provide the missing computational anchor for a mirror of this paper.
fails bit a — no named computational result to mirror
No computational result is covered; the named results concern logical preference criteria, utility representations, and social aggregation.
I don’t see a qualifying anchor in this paper. It contains no named result asserting that a computational problem is in P, NP-hard, FPT, or otherwise classifying its complexity.
The nearest candidates are Proposition 11, which characterizes when preferences over correspondences have a subjective expected-utility representation, and Corollaries 17 and 18, which give conditions for social utility aggregation and dictatorship. These are representation and axiomatic results, not computational results. Proposition 8 characterizes preferences under complete ignorance; Proposition 12 relates several preference orderings. The paper proves these results here, but it does not analyze the complexity of computing the representations or checking the conditions.
A plausible population extension would treat each decision maker’s complete type as their belief and utility, with mass representing the share of decision makers of that type. One could then ask whether Pareto consistency forces a social utility density over those types. But that would continuize an axiomatic aggregation question, not supply a continuous computational mirror of a result in the paper. The belief masses in the paper describe uncertainty over states of nature; they are not population masses.
So the strongest honest positive case is limited: the aggregation section offers a natural starting point for a *new* continuous-population axiomatic project. It provides no computational anchor from which to state the continuous problems requested here.
The case against a ChoCo mirror is unusually strong because the paper supplies no computational result to mirror. Its named propositions and corollaries characterize preference relations and social aggregation; none classifies the complexity of a computational problem. That is the decisive gap for this programme.
The possible anchors do not repair it. Proposition 8 characterizes a logical preference relation under complete ignorance. Proposition 11 represents one decision maker’s preferences using a prior and utility. Proposition 12 relates several preference criteria. Their probabilities describe uncertainty over knowledge states, not shares of a population. Turning those states or belief masses into population mass would continuize the wrong object.
Corollaries 17 and 18 offer the strongest possible population mirror. One could model many decision makers by their complete types—beliefs, utilities, and any other parameters used—and ask for a continuum version of the paper’s Pareto aggregation results. That is a plausible axiomatic project, and a population with repeated types is a sensible regime. But the paper asks whether preference orderings satisfy representation or dictatorship conditions; it does not ask for an algorithm to find an outcome or classify the complexity of a decision problem. A computational wrapper could be added, but its input, output, and complexity question would be new choices, not a continuous version of a computational result in this paper.
The proponent is therefore right that the aggregation section could inspire further work, but that is not enough to make it a computational mirror. The honest negative case is not that no population scenario can be imagined; it is that every plausible one changes the paper’s subject from individual and social preference representation to a new computational task. That could be worthwhile elsewhere, but it does not give this paper a worthwhile continuous mirror under 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.