| paper | d4-journals-mss-2011-0047 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper’s numbered proposition characterizes when bargaining utilities move together as production possibilities change; it makes no computational claim. Repeating households would either reproduce that analytic result household by household or require a new cross-household allocation model and computational objective.
fails bit a — no named computational result to mirror
No result is covered: Proposition 1 is analytic comparative statics, and the applications and discussion provide no computational result.
I cannot make a positive case that meets the anchor requirement. The paper has no numbered result asserting a computational complexity or algorithmic classification.
Its numbered result, Proposition 1 (proved in the paper), says that under any generalized utilitarian bargaining solution or the Kalai–Smorodinsky solution, a change in production possibilities benefits both agents or harms both if and only if their utility functions satisfy Almost Transferable Utility. That is an analytic comparative-statics result, not a claim that a computational problem is in P, NP-hard, or otherwise classified. It therefore cannot serve as one of the required anchors.
A possible extension would give mass to types of households, with a type specifying the household members’ preferences, threat point, and bargaining rule, then study how production changes affect those households. But the paper does not analyze that population model, and its proposition does not establish a computational result about it. The paper’s continuous objects are production bundles and utility possibility sets; the society itself remains two agents. So presenting that extension as a continuous mirror of a named result would overstate the case.
The proponent is right about the decisive gap: Proposition 1 is a comparative-statics theorem, not a computational result. The paper gives no complexity classification or algorithmic problem to mirror. Its central objects are a two-person utility possibility frontier and changes in a production set; it never models society as a distribution over agent types.
The strongest rescue is a population of repeated households. A household type could fully specify both members’ preferences, disagreement point, bargaining rule, and exposure to production changes. That is a plausible high-multiplicity regime, so I would not reject it on the grounds that household members have identities or that repetition is artificial. But if households are independent copies, the theorem applies household by household; aggregating the resulting gains or losses adds a statistic, not a computational question. If households share production and resources, then allocating across households requires new social aggregation and bargaining structure that the paper does not supply. A policy-selection problem over that structure might be worthwhile, but it would be a new model rather than a mirror of this result.
So the negative case is strong as a verdict on this paper as a ChoCo anchor: there is no named computational result to continuize, and the most plausible population extension either remains an analytic replication or needs a new computational objective. It is weaker as the universal claim that no related continuous computational project could be worthwhile. The paper’s household setting makes such a project conceivable; it simply does not establish one.
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.