| paper | d4-journals-mss-2010-0016 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The numbered propositions establish conditional uniqueness and characterize extraction, transfer, and utility dynamics, but none states an algorithm, a complexity result, or a computational formulation used to compute. The opponent also explains why treating dated generations as mass types would change the resource transitions and coalition structure, rather than relax the population in the paper’s model.
fails bit a — no named computational result to mirror
No result is covered by a continuous computational mirror: Proposition 1 gives conditional uniqueness, while Propositions 2–4 characterize extraction, transfer, and utility dynamics without computational claims.
I can’t make a defensible positive case that meets your anchor requirement: the paper contains no named computational result. Proposition 1, proved in the paper, says that if the transfers are feasible, the allocation satisfying the core lower bounds and aspiration upper bounds is unique. Propositions 2–4 characterize extraction paths, early transfer dynamics, and a condition for declining utility. These are economic and analytic results, not classifications of an algorithmic problem as tractable or hard.
The maximization programs in the paper do not change that: the authors characterize an infinite sequence of extraction and transfer choices, but give no computational problem with an input model, algorithm, running-time bound, or hardness result. A continuum of agents within each generation might motivate a separate high-multiplicity extension, but it would not be anchored by the paper’s results. Its generations are indexed over discrete time, and replacing them with population mass would need its own justification.
So the honest positive-side conclusion is that there is no qualifying anchor here, and therefore no continuous problem per anchor to hand to a prover. The nearest result is Proposition 1, but presenting its uniqueness theorem as a complexity result would overstate the case.
I don’t see a computational anchor to defeat. The proponent’s closest candidate, Proposition 1, proves conditional existence and uniqueness of a fair allocation. Propositions 2–4 describe extraction and transfer dynamics. None states a computational problem with a finite input representation, an algorithm, or a complexity bound. The optimization programs define coalition values over infinite sequences and production functions; they do not provide a computational result. Asking how to compute those values under a finite horizon and a specified encoding could be worthwhile, but those choices would create a new problem rather than mirror a result in this paper.
The best population-based reinterpretation does not supply the missing anchor. Replicating identical people within each generation aggregates to the generation-level decisions the paper already models; it introduces no multiplicity-driven combinatorial question. Treating generations themselves as mass types fares worse: a generation’s date determines its inherited resource stock, its place in the transition, and the coalitions it can join. Replacing the ordered sequence with a distribution over generations would continuize time and change the model’s structure.
So the case against a mirror of this paper is strong: its results are economic characterizations, and its central actors are not interchangeable members of a population whose multiplicity a continuum relaxation could address. The limit of that case is the word “any.” A new finite-horizon computational study inspired by the model might be valuable, but it would add the computational question the paper never asks.
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.