| paper | d4-journals-geb-2001-0053 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorems 1–3 characterize which bargaining solutions satisfy ex ante efficiency, where efficiency is a preference property rather than a computational guarantee. No named result asserts an algorithm, complexity bound, hardness result, or computational formulation, so bit (a) fails before a population mirror can be assessed.
fails bit a — no named computational result to mirror
No result is covered by a continuous computational mirror; Theorems 1–3 characterize solution classes but state no computational result.
I cannot make a strong, honest case for a continuous computational mirror anchored in this paper: it contains no named computational result asserting hardness, tractability, or another complexity classification.
The closest results are Theorems 1–3, all proved in the paper. Theorem 1 says that for \(n>2\), a bargaining solution is efficient with respect to minimax regret if and only if it is dictatorial. Theorem 2 says that for \(n=2\), such a solution is efficient with respect to minimax regret if and only if it is a monotone \(u\)-path solution. Theorem 3 says that for \(n\ge2\), efficiency with respect to normalized minimax regret holds if and only if the solution is a normalized monotone \(u\)-path solution. These are axiomatic characterizations, not computational results.
A many-bargainer extension might be imaginable, but turning it into a computational mirror would require inventing a representation for feasible utility profiles and a new algorithmic question. The paper supplies neither. Its feasible outcomes are already continuous utility sets, and its uncertainty concerns bargaining states; neither makes the population a continuous object. Those features do not provide a defensible ChoCo mirror.
The decisive gap is that Theorems 1–3 do not state computational results. “Efficient” means that no contingent contract is strictly preferred by every bargainer; it says nothing about running time. The theorems characterize which solution mappings have that property. The paper gives no encoded input, algorithmic task, or input size whose complexity a continuous-population version could classify.
The best possible population reinterpretation still does not rescue those anchors. For Theorem 1, one could imagine many bargainers grouped by type and ask whether a type-mass version preserves the dictatorship characterization. But minimax regret is evaluated for each bargainer’s own utility coordinates: duplicating a type does not change its regret. If masses are made to affect the criterion, that is a new, mass-weighted bargaining rule. And an atomless population changes what unanimity and Pareto improvement mean, so it changes the theorem’s central condition.
Theorem 2’s two bargainers are two distinct principals, not two samples from a population. Many people inside either side could motivate a new model of collective bargaining, but the paper supplies no rule for aggregating their utilities or preserving their individual stakes. Theorem 3 has the same problem for arbitrary finite \(n\): its normalized paths live in \(\mathbb{R}^n\), and the theorem contains no type masses. A distribution over many people would need to generate the feasible utility set and define the group’s objective before the characterization could be applied. Those are substantial new modelling choices, not a continuous mirror of the theorem.
Nor do the paper’s existing continua provide the missing population axis. Feasible outcomes are already continuous utility sets, while uncertainty is over two states and regret takes a worst case across them. Neither is a distribution over agents. One could separately ask for an algorithm to compute a chosen path solution from a particular finite encoding of a bargaining set, but that would be a new computational problem with complexity determined by that encoding—not a complexity result latent in Theorems 1–3.
This does not prove that no useful computational theory of bargaining among large populations can be built. It does make the negative case strong for this paper: each apparent anchor requires adding both a population model and a computational task that the paper never specifies. The resulting project may be worthwhile, but it would not be a continuous computational mirror of these 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.