| paper | d4-journals-mss-2000-0003 |
| 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 theorems derive utility representations and characterize efficiency and choice rules, but state no algorithm, complexity bound, or computational formulation used to compute. The proposed type-mass bargaining optimization would be a new computational question, not a continuous mirror of a computational result in this paper.
fails bit a — no named computational result to mirror
No named result has computational content to mirror; Theorems 1–6 derive utility representations and characterize efficiency and social choice rules.
This paper contains no named computational result to anchor a continuous mirror: none of its numbered theorems classifies a problem’s complexity or presents an algorithm the paper computes with. Theorems 1–6 derive utility representations, characterize efficiency, and axiomatize generalized utilitarian and Nash social choice functions. Those are mathematical and axiomatic results, not computational ones.
The paper also makes lotteries over alternatives part of its model, but that is continuity in the outcome space, not in the population. A high-multiplicity bargaining problem might be worth studying, but it would be a new computational question, not a mirror anchored in a named computational result of this paper.
The strongest case against a mirror is that the paper gives no computational problem to continuize. Theorems 1 and 2 derive utility representations; Theorems 3 and 4 characterize efficient lotteries; Theorems 5 and 6 axiomatize generalized utilitarian and Nash choice functions. None specifies a computational input, an algorithm, or a complexity claim. The proponent’s observation that the paper contains no named computational result therefore survives: there is no result here whose complexity landscape the continuous-population programme can chart.
The best candidate is a high-multiplicity bargaining problem. Group agents with identical utility functions into types, represent them by rational masses, and ask for a lottery maximizing aggregate utility, such as \(\sum_t \mu_t u_t(\ell)\), or a normalized Nash objective such as \(\exp(\sum_t \mu_t \log u_t(\ell))\). That is a sensible question, and the paper’s characterizations could help motivate it. But it adds an encoded outcome space, an optimization task, and a population aggregation rule that the paper never studies. The theorems say which rules satisfy axioms; they do not ask how hard those rules are to compute. So this may be a worthwhile adjacent project, but it is not a computational mirror of a result in this paper.
The paper’s use of lotteries does not supply the missing population model: it makes outcomes probabilistic, while the agents remain finite. That is not a reason to dismiss the paper because its outcomes are already continuous; it simply does not establish a continuous society.
This negative case is strong on the absence of an anchor, but weak as a universal claim that no worthwhile mirror could exist. The high-multiplicity bargaining extension is plausible. What the paper supports is the narrower conclusion that such work would be a new computational question inspired by its axioms, rather than a continuous mirror of its results.
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.