| paper | d4-journals-geb-2020-0080 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 1 and Theorem 2 establish implementability under stated conditions, and their proofs construct mechanisms, but neither analyzes computation or gives a complexity claim. No named result therefore satisfies bit (a), so a continuum-population implementation problem would be a new question rather than a mirror of a computational result in this paper.
fails bit a — no named computational result to mirror
Theorem 1 and Theorem 2 are the closest named results, but neither supplies a computational mirror; the examples and remaining discussion likewise provide no computational guarantee to anchor one.
I can’t make an anchored case for a continuous mirror from this paper under your criterion: it contains no named computational result asserting tractability, hardness, or a parameterized complexity classification.
The closest results are Theorem 1, proved in the paper, which says that an SCF satisfying closure under interim utility equivalence is Bayesian implementable, and Theorem 2, also proved there, which says that an SCS satisfying closure and interim inseparability is Bayesian implementable. Both are mechanism-existence results. They do not analyze an algorithm or the complexity of deciding or computing implementation.
The paper’s probabilities \(q\) describe beliefs over states for two agents with finite type sets; they are not masses of agents in a society. Making those agents into a continuum would change the implementation problem. A continuum-population version might be a worthwhile new research question, but it would have no qualifying anchor in this paper. Its lotteries over outcomes and its probability distributions do not supply one either.
The negative case is unusually strong at the programme’s first gate: this paper has no named computational result to mirror. Theorem 1 says that closure under interim utility equivalence is sufficient for Bayesian implementation; Theorem 2 gives a corresponding sufficient condition for social choice sets. Their proofs construct mechanisms. Neither theorem studies an algorithm, a complexity classification, or a computational problem with an encoded input and running time. The proponent names these as the closest results, and correctly notes that neither is a computational anchor.
The strongest attempted rescue would turn the conditions themselves into computational questions: given a finite encoding of types, probabilities, utilities, and an allocation rule, decide whether closure holds or find a mechanism. That could be a new research direction, but it would require choosing an input model and defining a computational task the paper does not study. Replacing finite type sets with continuous ones would add a functional-analysis or mechanism-design question; it still would not make either theorem a result about population complexity.
The paper’s probabilities also do not supply the missing population. \(q\) is a prior over the possible private states of two strategic agents. Its weights express uncertainty about which types those agents have, not fractions of a society holding each type. Turning the two agents into large groups would change the strategic model and its incentive constraints; keeping the two strategic agents leaves the population finite. The voting and facility-location examples retain that two-agent structure. Their lotteries and type distributions do not change it.
A continuum-agent implementation problem could be worth studying in its own right. But it would be a new problem built from the paper’s ideas, not a continuous mirror of a computational result in the paper. The universal claim that no future scenario could make such a problem worthwhile is impossible to establish from this text alone. The strongest defensible negative verdict is narrower: under ChoCo’s criterion, this paper offers no computational anchor, and the plausible continuous extensions change the object being studied.
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.