| paper | d4-conf-sagt-2023-0010 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
The numbered results establish incentive properties and asymptotic payment bounds, but none gives an algorithm, complexity bound, or hardness result. The paper’s optimization definition may motivate a separate computational study, but the required computational anchor is absent.
fails bit a — no named computational result to mirror
The cited results concern US-VCG incentive compatibility and vanishing payments; none supplies a computational guarantee for a continuous-population mirror.
This paper has no named computational result to anchor a continuous mirror. Theorem 4.9 and Corollary 4.10 establish incentive compatibility; Theorems 5.8 and 5.10 establish that payments vanish with population size. None states a computational complexity result or gives an algorithm for a named underlying problem.
The welfare-maximizing budget decision is defined through an optimization problem, and the paper observes that it depends on average preferences. But that does not amount to a named result about the problem’s complexity. A continuum of preference types could be a plausible model for large-scale participatory budgeting, yet I cannot honestly turn it into the requested anchored computational question from this paper. There are therefore no qualifying anchors, and no per-anchor continuous problems to state.
The proponent offers no qualifying anchor. The paper’s numbered results concern strategyproofness and payments as the population grows; none gives a worst-case complexity claim or an algorithm for a named computational problem. Observation 1 says the welfare optimum depends on average preferences and can be computed in time independent of \(n\), but gives no input encoding or running time in \(m\), support size, or bit length. There is no computational result here for a continuous mirror to preserve.
The strongest candidate is Theorem 4.9 on strict strategyproofness. In a nonatomic society, one person has zero mass, so changing their report does not change the mean type or the outcome. Truthfulness then becomes weakly true for every report, while strict truthfulness disappears. Treating a positive-mass type group as the strategic player could preserve an effect on the outcome, but it changes the theorem’s individual incentive question into a bloc-manipulation question.
The payment results have the same limiting problem. A continuous mirror of Theorems 5.8 and 5.10 would ask about payments to infinitesimal agents; their individual externalities vanish. One could instead study the limiting density or aggregate of rescaled payments, but that is a new object requiring its own formulation. The paper’s results do not pose a computational question about it.
A more ambitious rescue would ask for the complexity of computing the US-VCG outcome from a distribution over preference types. Yet the paper’s mean-dependency reduces that distribution to its mean before optimization. Any complexity question then depends on a newly chosen encoding for the utility functions and their parameters; it is an adjacent algorithmic problem, not a mirror of a computational result in this paper. This is a strong case against a ChoCo mirror under the programme’s criteria. It cannot rule out every useful follow-on question, but such a question would need to be introduced as new work rather than as the paper’s continuous counterpart.
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.