| paper | d4-journals-jet-2006-0064 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Neither candidate theorem states that an object can be computed or that computing it is hard; Theorem 2 is explicitly nonconstructive. The proposed continuous OSV would also need a new account of consistency, since removing one agent from an atomless population removes zero mass, and it is not anchored in a computational result from this paper.
fails bit a — no named computational result to mirror
No result is covered by a qualifying computational mirror. Theorem 2 and Theorem 3 are existence results; the other numbered results characterize the Shapley value or establish properties of the OSV.
The strongest honest positive case is a research lead, not an anchor-compliant case: this paper contains no named computational result of the kind the programme requires. Its numbered results concern existence and properties of a normative solution concept, rather than complexity or algorithms.
The closest lead is Theorem 2, proved here: with strictly quasiconcave preferences, the OSV is nonempty and individually rational in economic environments. But the paper explicitly says its fixed-point proof is nonconstructive and gives no algorithm for calculating an OSV allocation. Theorem 3, proved here, gives the analogous existence and individual-rationality result for the weighted OSV. Neither establishes a computational result. The other numbered results characterize the Shapley value or describe structural properties of the OSV; they do not compute with a formulation. So none qualifies as an anchor under the requested standard.
There is a plausible *unanchored* population-continuous direction. Let a type be a consumer’s complete description \(\theta=(\succ_\theta,w_\theta)\): preferences and initial endowment. Let \(\mu\) give the mass of each type, and let \(x(\theta)\) be its allocation. Feasibility would require \(\int x(\theta)\,d\mu \leq \int w_\theta\,d\mu\). A natural scenario is a large exchange economy with many consumers but relatively few preference–endowment types. The computational question might be whether one can compute an OSV allocation for such a mass distribution.
The obstacle is foundational: the paper defines OSV recursively by removing one agent and considering the remaining \(n-1\). In an atomless population, removing one agent removes zero mass, so the paper supplies no direct continuum definition of its concessions or consistency condition. A limit of OSV allocations in replicated finite economies is one possible research question, but that would be a new problem, not a mirror anchored in a named computational result here. Also, divisible commodity bundles alone do not satisfy the programme’s scope; the population would need to be the continuous object.
The soft spot is therefore decisive: the most plausible mirror requires defining a new continuum OSV, and the paper provides no qualifying computational anchor for it. I would not present this paper as supporting a positive case under the requested criteria.
The strongest case against is that this paper has no computational result to continuize. Theorem 2 proves that the OSV exists and is individually rational; Theorem 3 does the same for the weighted OSV. Theorem 2’s fixed-point proof is explicitly nonconstructive. Theorem 1 and the other numbered results characterize the solution or establish its properties. None studies an algorithm, a running time, or the complexity of a computational problem. That makes the paper a poor anchor for ChoCo’s stated programme.
The best version of a Theorem 2 mirror would take a large exchange economy with finitely many preference–endowment types and ask how to compute an OSV allocation from their masses. But the paper defines consistency by removing one agent and applying the solution to the remaining economy. In an atomless society, removing one agent changes nothing. To preserve a substantive condition, one would need to remove positive mass, take a derivative, or define the result as a limit of replicated finite economies. Each is a plausible research question, but each adds a new model and needs its own existence, selection, and input-representation choices. The paper supplies none of those computational ingredients.
The weighted case has the same gap. One could assign each type a weight density and ask for an algorithm to compute a weighted OSV in a population with finitely many types. But Theorem 3 is still an existence result, not a complexity result; the continuum weighting scheme and computation problem would have to be specified from scratch.
The proposed finite-type exchange economy is a sensible continuous-population scenario, so I cannot honestly rule out a worthwhile project built from it. But that would be a new computational study of a continuous OSV, not a mirror of a computational result in this paper. The negative case is therefore strong at the anchor test and weaker as a universal claim: the paper gives no qualifying computational anchor, but its subject matter does admit a plausible population-continuous research direction.
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.