| paper | d4-journals-jet-2013-0112 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | no |
The proposed anchors are structural implementation results: Theorem 1 characterizes implementability, and Proposition 4 rules out a class of deterministic rules, but neither asserts an algorithm or computational hardness. A continuum of expert types would also require a new bargaining model over masses, so the suggested extension supplies no surviving computational mirror.
fails bit a — no named computational result to mirror
No result is covered by a computational population mirror. Proposition 3 gives a closed-form rule for a symmetric Nash-bargaining case, but neither case states a continuous-population computational question for it.
I can’t make a compliant anchored case for a continuous mirror: the paper has no named computational result asserting tractability, hardness, or a parameterized complexity classification.
The closest anchor is Theorem 1, proved in this paper using Propositions 1 and 2. It says that for every bargaining solution satisfying Pareto efficiency, the dummy axiom, and continuity, the policy maker’s first-best outcome is implementable if and only if it is Pareto undominated for the committee. Proposition 2 constructs an implementing closed rule for every Pareto-undominated outcome. This is an existence and characterization result, not a complexity result: the paper gives no encoded input model, running-time claim, or hardness reduction.
Proposition 4, also proved here, is another near miss: with two experts and a one-dimensional outcome space, for almost every bias tuple, no continuous deterministic rule implements the first best under a disagreement-dependent Pareto-efficient solution. That is an impossibility theorem about policy rules, not a computational classification.
The most plausible population regime would be a large advisory body with many experts sharing a small number of complete preference types. One could ask whether a policy maker can choose a type-conditioned lottery over experts’ proposals that implements the first best against committee collusion. But the paper’s bargaining problem is defined for a finite tuple of named experts, and it supplies no continuum-agent bargaining solution. Collapsing each type to one representative would change the bargaining problem; retaining masses would require specifying how mass affects bargaining. So this would be a new model, not a precise mirror anchored in a computational result of this paper. The paper’s continuous policies, outcomes, and lotteries do not make its population continuous.
The case against is strongest at the level of the programme’s scope: the paper has no named computational result to continuize. Theorem 1 and Propositions 1–2 characterize when a first-best outcome can be implemented, using Pareto undominance and axioms on the bargaining solution. They give no encoded computational problem, algorithm, running time, or hardness result. The paper’s Euclidean policy space and its use of continuity are not a continuous population: here continuity is a property of the bargaining solution or policy rule.
Theorem 1 is the strongest possible anchor, but its constructive half establishes that some closed rule exists; it does not provide a computational procedure for finding one. Its assumptions range over arbitrary bargaining solutions and strictly concave utility functions, without a finite representation of those inputs. One could add an encoding—for example, rational quadratic utilities and a specified bargaining solution—and ask how to compute an implementing rule. That would create a computational problem, but it would be a new one. Proposition 4 is an even weaker anchor for ChoCo: it rules out first-best implementation by continuous deterministic rules for almost every bias tuple when there are two experts and a one-dimensional outcome space. That is a structural impossibility result, not a complexity classification. Its “continuous” rule still acts on a finite tuple of named experts.
Even the paper’s more concrete Proposition 3, which gives closed-form probabilities for a symmetric quadratic Nash-bargaining case, does not supply a complexity target. Computing those probabilities from an explicitly represented finite input is already described by the formula. A harder version for general biases or utilities would need additional input assumptions; putting a distribution over expert types into that model would be another extension, not a mirror of a computational result here.
The best high-multiplicity scenario is a very large advisory committee with many experts in a small number of bias and preference types. It is imaginable, but the paper provides no canonical continuum bargaining model for it. The experts bargain as players in a binding coalition, and the rule can assign different probabilities to their individually named proposals. Replicating experts does not by itself say whether bargaining power scales per expert, per type, or by some other measure. In an atomless version, the dummy axiom also needs a new interpretation: removing one expert changes no mass, while removing a whole type is a different operation. Impose anonymity and aggregate probability by type, and the resulting model may be interesting—but it adds restrictions and a bargaining solution the paper does not supply. Preserve every identity-relevant distinction as part of type, and repeated types may disappear.
I cannot establish the universal claim that no large-committee scenario could motivate a continuous model; such a model might be worthwhile as a new project in bargaining or mechanism design. The negative case is weaker on that broad claim. It is strong on the paper-specific one: none of the anchors raised is a computational result, and turning any of them into a continuous computational question requires supplying the central computational problem and continuum bargaining model from outside the paper.
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.