| paper | d4-conf-atal-2020-0144 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Proposition 4.7 is a named impossibility result, but it concerns compatibility among mechanism properties, not whether computing anything is hard or tractable. The other named results establish properties of the proposed mechanism; a continuum version would ask about strategic guarantees under a changed population model, not mirror a computational result.
fails bit a — no named computational result to mirror
No result is covered by a continuous computational mirror: Proposition 4.7 is an economic impossibility, and the mechanism-property results likewise make no computational claim.
I can’t give a qualifying anchor for this paper. It contains no named result classifying the complexity of a problem—nothing asserting NP-hardness, polynomial-time solvability, FPT, or a related computational result.
The closest result is Proposition 4.7, proved in this paper: in the diffusion setting, no mechanism can guarantee any efficiency while satisfying non-deficit, individual rationality, and incentive compatibility. That is an impossibility about economic mechanism properties, not a computational-complexity result. Theorems 4.2–4.5 and Corollary 5.2 likewise prove properties of the proposed mechanism; they do not classify a computational problem.
A continuous population of participants with types that include valuations and network roles is imaginable, but Proposition 4.7’s obstruction comes from a two-agent line network. Replicating that network into a large cohort changes the strategic problem, while keeping the two pivotal agents leaves no meaningful high-multiplicity regime. I therefore can’t honestly state a continuous problem as the mirror of a qualifying anchor. The paper has no named computational result of the required kind.
The strongest objection is that this paper gives no computational result to continuize. Proposition 4.7 is an impossibility about efficiency, incentive compatibility, individual rationality, and non-deficit; Theorems 4.2–4.6 and Corollary 5.2 establish mechanism properties. None classifies the complexity of a computational problem. Asking whether those properties survive for a continuum of participants would be an economic or axiomatic question, outside ChoCo’s scope.
Proposition 4.7 is the closest possible anchor, but its obstruction depends on a single pivotal inviter in a two-agent line. Keep that inviter as an individual and the model remains essentially discrete at its critical point. Replace the inviter and invitee with positive-mass cohorts, and the relevant deviation becomes a coalition’s action rather than one agent’s; preserve individual deviations in a nonatomic model, and one person’s action generally has zero effect on the population outcome. Either choice changes the strategic problem behind the proposition. A richer continuum network model might be worth studying, but it would be a new network-mechanism question, not a continuous mirror of this result.
The most plausible computational rescue is to analyze the cost of running NRM, or to optimize mechanisms for large populations on structured networks. But the paper gives a direct mechanism whose operations are graph and valuation calculations; a complexity study of its finite implementation would not make population continuization do substantive work. Optimizing over alternative mechanisms would supply a new computational problem, rather than uncover a hidden complexity result in this paper.
The negative case is strongest as a claim about programme fit, rather than proof that no useful continuous network model could ever be built. The paper’s central results are about strategic guarantees in an identity-bearing graph, and it contains no computational-complexity anchor for the programme to mirror.
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.