| paper | d4-conf-atal-2021-0134 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The sequential theorem proves incentive and welfare properties for finitely many strategic agents, but makes no algorithmic or complexity claim. The proposed Poissonized optimization is a concrete extension, yet its stated formulation makes type masses irrelevant and removes the strategic incentives central to the paper, so it does not yield a surviving continuous-population mirror of a result in this paper.
fails bit a — no named computational result to mirror
No named computational result is mirrored. The single-batch and sequential theorems establish mechanism guarantees; the access-function propositions give welfare analyses, and the simulations describe parameter effects.
Strictly under your anchor rule, this paper gives me no eligible anchor. Its strongest near miss is the sequential-model theorem in §5.1; the supplied text does not show its number, so I won’t invent one. Proved in the paper, it says that under the stated assumptions on \(h\) and \(F_c(t)\), the MVP mechanism is individually rational and has a strict perfect Bayesian equilibrium that maximizes social welfare over symmetric strategy profiles: each agent chooses the welfare-optimal effort, reports truthfully, and reports immediately upon receiving a signal. That is a mechanism-design result, not a claim about a problem’s running time or complexity class. The single-batch theorem and the named access-function propositions have the same limitation. So I cannot present any of them as a qualifying computational-complexity anchor.
The strongest *candidate mirror*, if the reader is willing to treat that sequential theorem as motivation rather than an eligible anchor, is Poissonized Typewise MVP Effort Optimization. Imagine a large pool of people gathering information about one event, with relatively few shared source types. A type \(\theta\) specifies the signal likelihood \(P_\theta(X\mid Y)\), latency parameter \(\lambda_\theta\), and effort technology; \(\mu_\theta\) is its fraction of the pool. This is plausible where many contributors share the same access to information and costs.
Here is a precise version. Given rational type masses \(\mu_\theta\), a binary outcome \(Y\), finite signal alphabets, a rational prior, signal likelihood tables, rational \(\lambda_\theta,\eta>0\), and additive error \(\epsilon>0\), return an \(\epsilon\)-optimal vector \(z\ge 0\) maximizing
\[ J(z)=\mathbb E\!\left[\int_0^\infty \bigl(S(p_z(t),Y)-S(p_0,Y)\bigr)\eta e^{-\eta t}\,dt\right] -\sum_\theta z_\theta , \]
where \(S\) is the paper’s quadratic scoring rule and \(p_z(t)\) is the Bayesian posterior given reports received by time \(t\). The type-\(\theta\) reports form a marked Poisson process of rate \(\lambda_\theta z_\theta\), with marks distributed according to \(P_\theta(X\mid Y)\). A solution satisfies \(J(z)\ge\sup_{z'\ge0}J(z')-\epsilon\).
This is a population limit of the paper’s sequential effort objective. With \(N\mu_\theta\) contributors of type \(\theta\), set each one’s effort to \(q_\theta/N\) and \(z_\theta=\mu_\theta q_\theta\). For the paper’s exponential latency \(F_c(t)=1-e^{-\lambda_\theta ct}\), the aggregate report stream converges to the stated Poisson process, while total effort cost converges to \(\sum_\theta z_\theta\). The question retains the information-value path and effort tradeoff that the authors study, with population mass as the organizing object.
I would tentatively expect an additive-approximation Class A result when the number of types and signal alphabets are small: truncate the Poisson report histories and optimize over the resulting finite-dimensional effort domain. Further questions are whether MVP incentives extend to heterogeneous types and implement this optimum, how the approximation behaves as \(\tau\) grows, and whether the discrete optima converge at a useful rate.
The soft spot is substantial: the theorem concerns finitely many i.i.d. agents in symmetric equilibrium. It proves neither this heterogeneous-type limit nor any computational classification. The Poisson scaling is a plausible bridge to the authors’ objective, but it remains a proposed extension—not a result this paper establishes.
The paper offers no eligible computational anchor. Its results establish truthfulness, effort optimality, timeliness, and welfare properties for the FPM and MVP mechanisms. They do not state the complexity of a computational problem. The access-function propositions are closed-form welfare analyses, not complexity results either. By the paper’s own anchor rule, there is nothing here to mirror as a result about algorithms or complexity.
The Poissonized effort problem is the strongest candidate, but its nondegenerate limit changes the object under study. In an ordinary atomless population, each person has zero mass, so removing one person changes the information path—and their counterfactual MVP reward—by zero. A type-level deletion would instead remove a positive-mass coalition. Alternatively, with fixed positive per-capita effort, infinitely many signals arrive in every positive time interval. For finite signal alphabets whose likelihoods distinguish outcomes, their exact frequencies reveal the outcome immediately; any positive effort can then deliver full information, while its cost can approach zero. That limit does not preserve the paper’s timely marginal-incentive problem.
The proposed scaling avoids this collapse by making individual effort shrink with population size, leaving a marked Poisson stream of discrete reports. But in the stated optimization, the type masses then drop out. Since \(z_\theta=\mu_\theta q_\theta\), any positive \(\mu_\theta\) permits any \(z_\theta\ge 0\) when \(q_\theta\) is unbounded; both the report rate \(\lambda_\theta z_\theta\) and cost \(z_\theta\) depend on \(z_\theta\), not on \(\mu_\theta\). The task chooses intensities for a stochastic stream, rather than computing over a society whose type proportions matter. A per-capita effort cap could make those proportions bind, but that adds an assumption and yields a new optimization problem. The proposal also supplies likelihood and effort parameters that the paper says the principal does not know, and sets aside the strategic mechanism guarantee that motivates the paper.
So the strongest negative is that this paper does not supply a paper-anchored computational question, and its most plausible extension either degenerates as a population limit or becomes a different stochastic optimization problem. I cannot honestly establish the universal claim that no scenario could yield a worthwhile mirror: a carefully specified, capacity-constrained high-multiplicity model of information acquisition might be valuable. The paper itself, however, gives little reason to count that as a continuous computational social choice mirror of one of its results.
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.