| paper | d4-journals-jet-2007-0172 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
Theorem 1, Theorem 2, and Theorem 3 are axiomatic implications about social orderings; none asserts a computation, computational hardness, or a solver-based formulation. A distribution over preference types could support an axiomatic extension, but that does not give this paper a computational result to mirror.
fails bit a — no named computational result to mirror
No result has a computational mirror here; the proposed axiomatic extension would concern Theorems 1–3 over a distribution of preference types.
The strongest plausible population mirror is a continuum version of the paper’s social comparison problem. Let a type be a complete preference ordering \(R\), and let \(\mu_R\) be the fraction of society with that preference. An allocation assigns a bundle \(x(R)\) to each type, subject to per-capita feasibility \(\int x(R)\,d\mu(R)\leq\omega\). One could ask whether the paper’s Pazner–Schmeidler or Walrasian comparisons, and their support-mean equity principles, extend to these allocation functions. A large society with many agents but relatively few preference types is a plausible regime; the paper itself cites work on Pazner–Schmeidler rules in large societies.
That is a recognizable population-level question, but it is not a computational mirror of a result in this paper. There is no named computational result here: no theorem asserts tractability, hardness, or an algorithm for a computational problem. Theorem 3, the closest potential anchor, is proved here but is axiomatic: it says that on the domain of convex or non-convex economies, any social ordering function satisfying Weak Pareto, Transfer Principle, Hansson Independence, Scale Independence, and Minimal Preference for Equality must strictly prefer \(x\) to \(y\) whenever the Pazner–Schmeidler ordering strictly prefers \(x\) to \(y\). Theorem 1 and Theorem 2 likewise derive ordering implications from axioms on convex economies. None is a computational anchor of the required kind.
So I can’t honestly state one continuous problem per eligible anchor, or predict whether such an anchor’s hardness transfers or dissolves. A continuum version of Theorem 3 would remain an axiomatic characterization; the programme asks computational questions, and the paper’s conclusions do not supply those. The large-society citation supports the plausibility of a high-multiplicity regime, but it does not turn this paper’s results into computational ones.
The case against a ChoCo mirror is strongest at the point the proponent identifies: this paper has no named computational result to mirror. Theorem 1, Theorem 2, and Theorem 3 are axiomatic implications about social ordering functions. None studies an algorithmic problem, specifies its input and output, or establishes a complexity or approximation result.
The proposed continuum of preference types is a plausible extension of the model, but it does not give any of those theorems a computational counterpart. The paper’s results concern which comparisons an ordering must make when it satisfies stated ethical conditions. A continuum version could ask the same axiomatic question for distributions of types; that would still be an axiomatic extension, outside ChoCo’s computational scope. The suggested type-constant allocation \(x(R)\) also leaves out unequal bundles among people with the same preferences, which the Transfer Principle explicitly compares. Allowing a distribution of bundles within each preference type could restore that comparison, but would make the extension richer without turning it into a computational result.
A stronger computational proposal might ask how to evaluate \(R^{PS}\) or \(R^W\), or find a best feasible allocation under either criterion, for finitely encoded preference types. Those could be worthwhile questions. But the paper assumes abstract preference orderings over bundles and supplies no computational representation for them. Choosing an encoding and posing an algorithmic task would start a new project; its answer would not mirror Theorem 1, 2, or 3. That remains true even though the paper discusses first-best selections and cites work on Pazner–Schmeidler rules in large societies.
That large-society work is evidence that a high-multiplicity regime makes sense, not a novelty collision. It strengthens the modelling case for a continuum extension, but it cannot supply the missing computational anchor.
So I find no surviving computational mirror of the results in this paper. The negative case is strong for this paper as a ChoCo target, but it does not establish that every adjacent computational project would be unworthy; those projects would need to be proposed and assessed in their own right.
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.