| paper | d4-conf-aaai-2021-1079 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
Theorem 3 and Theorem 1 are computational results, but the proposed full-support society imposes exactly the same all-location constraint as the paper, independent of μ. The paper’s proxy-design model already covers that question, while a mass-sensitive coverage objective would be a new problem not anchored by these results.
fails bit b-already — the paper is already native to the continuum
The proposed mirrors restate Theorems 1 and 3; they do not cover the proxy-count bounds as population-dependent results. Proposition 3 is an outcome guarantee, not a computational anchor, and the paper does not study mass-sensitive proxy coverage.
The strongest positive mirror is robust proxy design for a spatially distributed electorate. A type is a voter’s ideal point \(v\in[0,1]\); candidates are at the paper’s rational locations \(C=\{c_1,\ldots,c_m\}\), and preferences follow distance. The society is a probability distribution \(\mu\) over ideal points, with mass \(\mu(A)\) representing the fraction of voters in a region \(A\). Take \(\mu\) to have full support on \([0,1]\), for example a rational piecewise-constant density that is positive on every interval.
This fits a large electorate whose views span a one-dimensional policy spectrum and whose composition may change. The idealized population is continuous, so there is no finite support size \(\tau\) to compare with the number of agents; at finite resolution, many voters may occupy each policy region, but the exact model retains a continuum of possible ideal points. That makes this a weaker high-multiplicity fit than a model with finitely many shared types.
My lead problem is Full-Support Unrestricted Proxy Design. Given \(C\), \(\theta\in(0,1)\), and a full-support \(\mu\), output a finite proxy set \(P\subset\mathbb R\) of minimum cardinality such that, for every \(v\in\operatorname{supp}(\mu)=[0,1]\),
\[
\left|\operatorname{top}(v)-\operatorname{top}(p_v)\right|\le \theta,
\qquad
p_v\in\arg\min_{p\in P}|v-p|.
\]
The solution is the proxy set \(P\). The support-wide condition makes the guarantee apply to every possible voter type, not merely to most of the electorate. The density records how mass is distributed, while the constraint is a per-voter representation guarantee, so mass values do not affect feasibility.
The anchor is Theorem 3, proved in this paper: given any instance \(\langle C,\theta\rangle\), a polynomial-time algorithm returns an optimal \(\theta\)-representative proxy arrangement with unrestricted proxy locations. The full-support mirror has the same feasible sets and optimum, so the theorem solves it in polynomial time. I expect this mirror to be tractable. It is a Class A result in the broad sense, though the paper’s algorithm uses dynamic programming rather than the continuous-optimization machinery highlighted by ChoCo.
A second, closely related mirror is Full-Support Restricted Proxy Design, with the same instance, feasibility condition, objective, and output, but requiring \(P\subseteq C\). Its anchor is Theorem 1, also proved here: an optimal \(\theta\)-representative arrangement under restricted positioning can be computed in polynomial time. This mirror is tractable for the same reason. The unrestricted variant is my stronger anchor because its decision variables genuinely range over the real line; the restricted variant covers the paper’s other positioning regime.
The authors could plausibly recognize these as their problem in a distributional setting: they choose proxies without knowing voter locations and guarantee representation for every location, which is stronger than guaranteeing it for the support of one full-support electorate. The paper’s Proposition 3, proved here, also shows that a \(\theta\)-representative arrangement gives a \(\theta\)-close direct-versus-proxy outcome under strict-Condorcet rules with consistent tie-breaking. That supports the value of the robust guarantee, though it is not a computational anchor.
The main weakness is that the population distribution is nearly decorative: because the paper already requires representation at every point of \([0,1]\), its algorithms do not use the masses. This is a reasonable mirror of a per-voter fairness guarantee for a continuous electorate, but it does not show that population continuization creates the tractability. A genuinely mass-sensitive follow-up would ask for the fewest proxies that \(\theta\)-represent at least \(1-\varepsilon\) of \(\mu\), or how the optimum changes when \(\mu\) has restricted support. Those are new questions; Theorems 1 and 3 do not settle them. This case covers the paper’s optimal-arrangement results only, not its proxy-count bounds or the full range of outcome claims.
The strongest objection is an exact collision. For the natural spatial type \(v\in[0,1]\), define
\[
\mathcal F(C,\theta)=\{P:\ |{\rm top}(v)-{\rm top}(p_v)|\le\theta\ \text{for every }v\in[0,1]\}.
\]
If \(\mu\) has full support on \([0,1]\), the proponent’s constraint gives precisely this same feasible set. Theorem 3 already finds its minimum-cardinality member in polynomial time. Requiring \(P\subseteq C\) gives the same collision with Theorem 1. Adding rational masses to the input changes neither feasibility nor the optimum; the algorithms have no population or mass parameter to use. These anchors therefore restate the paper’s computational problem rather than continuize its population.
That follows from the paper’s formulation: voters need not be specified, and the guarantee is for every possible location. Ideal points already range continuously over the interval. A full-support distribution merely labels that existing domain with weights the constraint ignores. The same is true for a finite-support society when every supported type must be represented: positive masses impose the same pointwise constraints regardless of their values or how many individuals share a type. Multiplicity has no role in either named result.
The strongest alternative is to make mass affect the requirement—for example, minimize the number of proxies that represent at least \(1-\varepsilon\) of \(\mu\), or maximize represented mass with a fixed proxy budget. That is a natural distribution-aware problem, but it replaces the paper’s guarantee for every possible voter with a guarantee for most of a specified population. Theorems 1 and 3 do not anchor it; its value would come from that new objective. Proposition 3 is an outcome guarantee, not another computational anchor.
So the case against the proposed mirrors is strong: both named theorems transfer unchanged because their constraints already quantify over the entire continuous location space. The broader claim that *no* scenario could yield worthwhile work is weaker. A mass-sensitive proxy-design problem could be worthwhile and might be recognized by the authors as a follow-up. The paper alone does not rule that out; it does show that such work would need a new population-dependent question, since these anchors do not supply one.
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.