| paper | d4-conf-atal-2021-0109 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Neither named theorem asserts that a mechanism can be computed or that computing one is hard; both are mechanism characterizations. The weighted quantile task is computable, but it drops the paper’s unilateral incentive condition, so it does not supply a computational mirror of either theorem.
fails bit a — no named computational result to mirror
The proposed quantile task computes the outcome of a chosen order-statistic rule, but leaves the strategyproofness characterization on discrete lines and trees unmirrored.
I can’t give a fully compliant positive case under your anchor rule: the paper has no named result about a problem being in P, NP-hard, FPT, or otherwise computationally classified.
The closest result is Theorem 6.3, proved in the paper: on an infinite discrete line, an onto mechanism is anonymous, shift-invariant, and strategyproof if and only if it is a \(k\)th order statistic for some \(k\). Theorem 5.1, also proved here, characterizes onto strategyproof mechanisms on discrete trees as exactly those satisfying TMON and ATC. Both are mechanism characterizations, not computational-complexity results.
The strongest positive lead I can make from Theorem 6.3 is a population limit of its order-statistic rule. Consider a long corridor modeled by the integer line \(\mathbb Z\), with many residents clustered at a relatively small number \(\tau\) of locations. A resident’s location determines their quadratic distance preferences, so location is a complete type. Represent the population by a finite-support rational distribution \(\mu\) over \(\mathbb Z\). For a fixed percentile \(q\in\mathbb Q\cap(0,1]\), ask for the facility location selected by the population’s \(q\)-quantile:
\(q\)-Quantile Facility Location. Given the supported locations and their rational masses in \(\mu\), and \(q\), output the smallest \(x\in\mathbb Z\) such that \(\mu((-\infty,x])\ge q\).
The solution is a facility location, and the expected complexity is polynomial in \(\tau\) and the input bit length: sort the supported locations and accumulate their masses. The connection to Theorem 6.3 is that \(q\) corresponds to a rank \(k\) whose fraction \(k/n\) is held fixed as the population grows. In a plausible regime—residents along a corridor with many people at each of a few neighborhood locations—this weighted quantile is a natural continuous-population version of an order statistic.
This is only a candidate mirror, not a qualifying anchor or a full mirror of the paper’s result. The theorem does not establish a complexity bound, and the quantile computation drops the strategic question. In an atomless population, one person’s report changes no mass, so individual strategyproofness becomes vacuous. Requiring that a positive-mass group cannot benefit from changing its report would instead ask about coalition manipulation, which is not the paper’s unilateral strategyproofness. Thus the computation has a sensible high-multiplicity interpretation, but the paper’s central characterization does not carry over cleanly.
The paper’s continuous-tree results concern continuous facility locations, not a continuous population, so they do not supply an alternative anchor under this programme’s scope. The weakest point is therefore also the central one: the plausible quantile limit preserves the outcome rule of Theorem 6.3, but not its incentive content.
The negative case starts with the paper’s main limitation as an anchor: it contains no named computational result. Theorem 5.1 and Theorem 6.3 characterize classes of strategyproof mechanisms; they give no complexity bound or algorithmic problem. The paper does not specify a representation of mechanisms that could serve as input to a complexity question. That leaves no computational claim for a continuous-population mirror to carry over.
The order-statistic example is a credible population scenario. Many residents may share locations on a corridor, and a distribution over those locations is a sensible high-multiplicity model. The weighted \(q\)-quantile is also a natural continuous counterpart to the \(k\)th order statistic when \(k/n\) approaches \(q\). Computing it from finite rational support is a well-defined task. But it computes the output of a chosen rule; it does not preserve Theorem 6.3’s characterization of strategyproof rules.
The difficulty is the theorem’s unilateral incentive condition. In a society described only by a distribution \(\mu\), one agent has zero mass, so changing that agent’s report leaves \(\mu\) unchanged. The condition becomes vacuous. Retaining an individual’s effect requires specifying a population size \(n\), so a report changes the distribution by \(1/n\). The same \(\mu\) can represent many population sizes, with different perturbation sizes. At quantile boundaries, those perturbations can change the selected facility by a finite distance even as \(n\) grows. The distribution alone cannot preserve the theorem’s exact incentive comparisons.
A stronger candidate would characterize limits of onto, anonymous, shift-invariant, strategyproof mechanisms as \(n\) grows. That could be a worthwhile limit question, but its incentive content still lives in the finite-\(n\) sequence and its \(1/n\) deviations. It would be an asymptotic characterization, not a computational question about a continuous society of the kind this programme targets. Requiring a positive mass to change its report would preserve nontrivial incentives, but changes unilateral strategyproofness into a coalition condition.
Theorem 5.1 has the same obstacle. A distribution over vertices of a tree is sensible, and the paper’s TMON and ATC properties may inspire conditions on how a facility responds to changes in mass. Yet the theorem derives those conditions from one agent moving between vertices. In a nonatomic population, that move has no effect on the input distribution; a positive-mass move again changes the strategic unit. So a mass-based characterization would need new incentive semantics rather than a continuous mirror of the theorem’s.
The paper’s continuous-tree results concern facility locations, not the population, and therefore are not prior continuous-population work. They do not supply an alternative computational anchor. The honest weakness in this negative case is that one could build a new algorithmic mechanism-design problem around these characterizations—for example, optimizing a facility mechanism under a chosen mass-based incentive notion. But that would require adding a computational task and choosing new incentive semantics. The paper itself offers no computational result to mirror, and its defining strategic condition loses its force when the population becomes nonatomic.
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.