| paper | d4-journals-jet-2014-0097 |
| 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 characterizes rules that can be represented by a CRAS maximization; it does not give an algorithm or complexity result. The other named theorems are also axiomatic characterizations, so the proposed creditor-type optimization would be a new computational study, not a continuous mirror of a computational result in this paper.
fails bit a — no named computational result to mirror
No computational result is covered; the proposed extension borrows the CRAS allocation form in Theorem 1 and leaves the other axiomatic results without a computational mirror.
I don’t find a named computational result in this paper that can serve as an anchor. Theorem 1, proved here, characterizes rules satisfying Resource Monotonicity, Bilateral Consistency, and IIA; Theorems 2–4 give further axiomatic characterizations. None asserts an algorithmic or complexity result. The CRAS description in Theorem 1 is an optimization characterization, but the paper does not use it to analyze the computational complexity of computing an award. So I can’t honestly present any of these as a computational anchor.
There is a plausible population-continuum extension. Imagine a large pool of creditors, with types \(t\) recording each creditor’s claim, endowment, and welfare function. Let \(\mu_t\) be the fraction of creditors of type \(t\), and let \(x_t\) be their per-creditor award. A natural allocation problem is to choose \(x_t\in[0,c_t]\) with \(\sum_t\mu_t x_t=E\), maximizing \(\sum_t\mu_t U_t(x_t)\). That looks like a continuum version of the CRAS allocation rule and could be sensible for creditors grouped by shared circumstances.
But this would be a new computational problem, not a result the paper establishes: its contributions concern axioms and rule characterizations, and the resource is already divisible while the claimant set remains finite. The paper therefore offers a plausible starting point for a future continuous-population study, but no eligible anchor for a continuous mirror under the programme’s criteria.
The paper supplies no computational anchor. Theorem 1 characterizes a family of rules by axioms; its CRAS formulation says which award vector a rule selects, but gives no algorithm or complexity result. Theorems 2–4 are also axiomatic characterizations. None defines a computational input model, and the paper gives no running time, hardness result, or algorithm to continue. So the proponent’s creditor example does not mirror a computational result in this paper.
It is a sensible population model: a large creditor pool could have finitely many types, with \(\mu_t\) the share of creditors of type \(t\), and awards chosen to maximize \(\sum_t \mu_t U_t(x_t)\) subject to \(\sum_t \mu_t x_t=E\). But making that model computational requires specifying how the utility functions are represented. The paper allows arbitrary continuous, strictly concave functions, which do not define finite algorithmic inputs. Restricting them to a computable class could yield a legitimate optimization problem, but that would be a new formalization and computational study, not a continuous mirror of a result established here.
That is the strongest defensible case against this paper as a ChoCo mirror: the gap is not that its society cannot sensibly be made continuous, but that the paper never asks the computational question a mirror is meant to continue. I cannot honestly extend that into the universal claim that no worthwhile continuous-population research could arise from the claims-division setting. The creditor scenario is plausible; it simply does not supply the missing computational result in this paper.
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.