| paper | d4-journals-jet-2015-0100 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorem 3 is a representation theorem, and the paper’s other named results likewise characterize preferences or rankings rather than computation. The proposed population-weighted welfare expression is a plausible extension, but it does not supply a computational problem anchored in a result of this paper.
fails bit a — no named computational result to mirror
No result is mirrored as a computational problem; Theorem 3, Theorem 5, and Proposition 6 remain representation characterizations.
The best positive foothold is Theorem 3, proved in this paper, in its uncertain social choice application. It says that under its stated domain conditions—open, connected, sectionally connected and indifference connected, with identical column spaces—and Row Preferences, Column Preferences, Coordinate Monotonicity, Continuity and Column Invariance, the characterization runs both ways: the ex post social order has a representation \(W_M(x)=\sum_i u_i(x_i)\); there is a strictly positive state-weight vector \(p\) such that each individual’s ex ante order is represented by \(\sum_j p_j u_i(x_j)\); and the overall order is represented by \(W(X)=\sum_j p_j\sum_i u_i(x_{ij})\). The vector \(p\) is unique, and the functions \(u_i\) are unique up to positive affine transformations with a common multiplier.
There is a natural population extension of that setting: a large society with \(N\) individuals but only \(\tau\) complete utility types, each type encoding the relevant state-contingent preferences. If \(\mu_t\) is type \(t\)’s population share, the corresponding per-capita welfare expression would be \(W_\mu(X)=\sum_t\mu_t\sum_j p_j u_t(x_{tj})\). That is a plausible continuous-agent extension of the paper’s aggregation framework.
But this paper contains no named computational result: no hardness result, algorithm, complexity classification, or computational formulation used to solve an underlying problem. Theorem 3 is a representation theorem; Theorem 5 and Proposition 6 are also characterizations, not computational results. So there is no eligible anchor from which to state a continuous computational problem per the requested rubric, or to classify its expected complexity. The population extension above is a possible future research direction, but presenting it as a mirror of a computational problem in this paper would overstate the case.
Theorem 3 gives a coherent population interpretation. A complete type could include an individual’s relevant utility functions, and a society could be represented by masses over those types. That respects high multiplicity: people with identical relevant preferences belong to the same type. The proposed \(W_\mu\) is a plausible continuous-agent welfare expression.
But Theorem 3’s result is an axiomatic characterization. Its input is a preference order on a domain of prospects; its conclusion is a representation of that order, with a unique state-weight vector under the stated assumptions. The paper supplies no computational problem, finite input encoding, or algorithmic output for this result. Extending the finite sum over people to an aggregation over types preserves the welfare interpretation, while leaving that absence untouched.
The strongest computational follow-up would be to provide finite encodings of type utilities and prospect constraints, then ask an algorithm to recover compatible weights or optimize welfare over feasible prospects. Those encodings, constraints, and tasks would need to be chosen independently: the theorem does not specify them. Checking its axioms from finitely many observations would also require a new input model, since the axioms concern preference orders over an open domain. Theorem 5 and Proposition 6 have the same basic character: they characterize representations and rankings rather than analyze computational problems.
So the proponent establishes that a continuous population version could make sense as a welfare-theoretic extension. That is a worthwhile mathematical direction, but it is outside ChoCo’s stated aim of continuizing a computational question. Under that scope, there is no eligible result here to mirror. The negative case is strongest on that boundary; it cannot establish that no worthwhile computational project could ever be built from this framework.
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.