| paper | d4-journals-mss-2001-0013 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
The paper’s numbered results characterize allocation rules through fairness and procedural axioms; none states a computational result. A distribution over claim types is a plausible population model, but asking how to compute awards under these rules would be a new task, not a mirror of a named result in the paper.
fails bit a — no named computational result to mirror
No computational result is covered: Theorem 1 and Theorems 2–11 are axiomatic characterizations. Computing the stated rules from claim-type masses is outside the paper’s results.
The strongest honest case is narrow: a continuous population of claimants is a sensible extension of the paper’s bankruptcy model, but the paper provides no named computational result to anchor a ChoCo mirror. Its numbered theorems characterize allocation rules by fairness and procedural axioms; they do not establish that a computational problem is in \(P\), hard, or otherwise classify its complexity. In particular, Theorem 1 (cited there to Moulin, 1997) characterizes three rules; it is not a complexity result. So I cannot present it as a qualifying anchor.
The natural population model would take types to be claim levels \(q_1,\ldots,q_\tau\), with mass \(\mu_j\) at each type, where \(\sum_j\mu_j=1\). Let \(e\) be the estate per claimant, with \(0<e<\sum_j\mu_jq_j\). A rule assigns each type an award \(a_j\), satisfying \(0\le a_j\le q_j\) and \(\sum_j\mu_ja_j=e\). The concrete computational question would be: given binary-rational \((\mu_j,q_j)\) and \(e\), compute the type-level awards under the proportional, constrained equal-awards, constrained equal-losses, or Talmud rule. This is a credible high-multiplicity version of applying the rules: many claimants share a claim, and the output is an award per unit mass of each type.
But that candidate question is not a mirror of a named computational result in this paper. The authors’ stated contribution is an axiomatic comparison, and their characterizations do not compute with an exponentially large type space or expose a pricing problem. The natural continuous analogue of Theorem 1 would classify allocation functionals over claim distributions by continuous versions of its axioms—an axiomatic question, outside the programme’s scope. The weakest point, and the decisive one for the requested case, is therefore the absence of a qualifying anchor. The paper supports the plausibility of a continuous claimant population, but it does not supply the computational result needed to make a strong, anchor-based case for a continuous mirror.
The strongest case against a ChoCo mirror is that the paper has no named computational result to continuize. Theorem 1 and Theorems 2–11 characterize allocation rules by fairness and procedural axioms; they do not classify the complexity of computing an allocation or solving an optimization problem. The proponent therefore supplies no qualifying anchor.
The proposed claimant distribution is nevertheless a sensible high-multiplicity model. Claims can define types, and an award per claimant type gives a coherent mass allocation. That establishes that a continuous society is plausible here; it does not turn the paper’s contributions into computational ones. Extending its characterizations to allocation functionals over distributions would still be an axiomatic question, outside ChoCo’s scope. Asking how to compute one of the four rules from type masses is a new computational task, not a mirror of a result this paper proves. Adding an objective such as minimizing conversion costs or choosing among rules would likewise introduce a problem absent from the paper.
The stronger objections about identity, multiplicity, or a degenerate limit do not hold up: creditors with the same claim can form a type, and per-capita estate and awards remain meaningful. The negative case rests on the mismatch between the paper’s actual results and the programme’s computational target.
So I would not prioritize this paper as a ChoCo mirror. But the universal claim that no worthwhile continuous mirror could exist in any scenario is stronger than the evidence supports: the continuous claimant model is credible. What fails is the case for a computational mirror of this paper’s stated contributions.
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.