| paper | d4-journals-jair-2019-0034 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorem 1 is an algorithmic convergence guarantee, so bit (a) holds. But the paper already models the population as a distribution over ideal points and studies convergence to its expected-welfare optimum; the proposed finite-type optimizer computes that same benchmark after replacing local responses with full information. This is a re-modeling of an already distributional society, not a discrete-to-continuous mirror, so bit (b) fails as b-already.
fails bit b-already — the paper is already native to the continuum
The proposed optimizer targets Theorem 1's societal-optimum benchmark. No separate population-continuization mirror survives; the experiments and other convergence results are not mirrored.
The best anchor is Theorem 1, proved in this paper. It says that, assuming the decision space is nonempty, bounded, closed, and convex, voters have unique ideal points drawn independently from a bounded measurable density, and their utilities are negative \(\mathcal L^p\) distance from those ideal points, ILV converges with probability \(1\) to a societal optimum when voters respond under either response model and the neighborhood norm is \(q\), for \((p,q)=(2,2),(1,\infty),(\infty,1)\). [The paper’s Theorem 1](https://arxiv.org/pdf/1702.07984) is an algorithmic convergence result; it does not classify a problem as polynomial-time solvable, hard, or parameterized. The paper has no named result of those conventional complexity types, and no hardness anchor to build on.
My lead candidate is Finite-Type Social Optimum for ILV Utilities. An instance is a bounded rational polytope \(X\subseteq\mathbb R^M\), a list of \(\tau\) types with rational ideal allocations \(a_t\in X\), rational masses \(\mu_t>0\) summing to \(1\), a choice of \(p\in\{1,2,\infty\}\), and a rational accuracy \(\epsilon>0\). Every member of type \(t\) has utility \(f_t(x)=-\|x-a_t\|_p\). The question is to return \(x\in X\) whose average disutility
\[
\Phi(x)=\sum_{t=1}^{\tau}\mu_t\|x-a_t\|_p
\]
is at most \(\epsilon\) above its minimum over \(X\). The solution is the allocation \(x\); the population enters through the type masses. I would expect this to be tractable: for \(p=1\) and \(p=\infty\), the objective has linear-program formulations; for \(p=2\), it has a second-order-cone formulation. This is a finite-support, high-multiplicity version of the societal-optimum question Theorem 1 studies through ILV.
A plausible regime is a large participatory-budgeting electorate whose members belong to a small number of organized constituencies, each using a shared canonical allocation and the same distance-based preference model. There could be millions of voters but only \(\tau\) distinct complete preference types, with \(\tau\ll n\). The authors should recognize the objective: their result explicitly concerns reaching the societal optimum from local voter responses. The mirror asks for the computational status when that society is supplied as explicit type masses.
The scope is only Theorem 1’s societal-optimum result for normed utilities; it does not mirror the paper’s experiments, mechanism-design claims, or other convergence results. Further questions include whether local-response access alone suffices for a polynomial-time \(\epsilon\)-approximation, and what finite-time guarantees replace the paper’s asymptotic convergence statement.
The weak point is substantial: the paper already models a continuum of voters, so this is not a new continuization of its population. Also, Theorem 1 assumes a bounded density over ideal points, whereas a finite list of types is atomic; its convergence proof does not establish the finite-type mirror. And exact shared ideal allocations among large groups may be a strained story. The positive case is therefore for a computational high-multiplicity extension of the paper’s welfare problem, not for claiming that the paper itself supplies a discrete complexity result waiting to be continuized.
The central convergence theorem is the strongest possible anchor here, but it proves a different kind of claim from a computational complexity result. It shows that ILV’s random sequence converges almost surely to a societal optimum under specified utility and response assumptions. It gives no bound on the number of voter queries needed to get within \(\epsilon\) of that optimum, and no algorithm whose input is an encoded society of rational type masses.
The proposed finite-type social-optimum problem is well-posed, but supplying the masses, ideal points, and feasible polytope gives the solver full information that ILV was designed to avoid asking voters to provide. Its objective, \(\sum_t \mu_t\|x-a_t\|_p\), has direct standard formulations: LPs for \(p=1\) and \(p=\infty\), and a second-order cone program for \(p=2\). That would compute the welfare benchmark without running ILV or using its local-response model. The paper itself stresses that eliciting ideal allocations is cognitively difficult and prone to bias. So this is a computational question about the same benchmark, but a poor mirror of the paper’s central problem.
The type model also changes the paper’s assumptions: its voters’ ideal points are drawn from a bounded density, so the distribution is atomless, whereas the proposed finite list of shared ideal points is atomic. That difference alone does not rule out a mirror; the model could be extended. But under that repair, the result would need new assumptions and would not follow from the theorem the proponent chose as its anchor.
The stronger repair is to preserve local-response access and ask for a finite-time welfare guarantee. Then the task is sample or query complexity for stochastic convex optimization: the paper already maps ILV to stochastic subgradient methods and points to existing convergence-rate machinery. A useful bound may remain to be proved for particular response models, especially when finite types create nonvanishing near-ideal-point events. But that looks like an analysis of the paper’s existing stochastic algorithm, not a new computational landscape produced by a high-multiplicity population input.
So the negative case is that the anchor’s offline version removes the paper’s defining information constraint, while its faithful version collapses into stochastic optimization already identified by the authors. This does not establish that no worthwhile finite-time or robustness result exists; that is where the case is weakest. It does make the proposed finite-type social optimum a doubtful ChoCo mirror rather than a clear new computational problem.
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.