| paper | Selecting Representative Bodies: An Axiomatic View |
| authors | — |
| venue | AAMAS 2024 |
| filed under | multiwinner · multiwinner |
| judged by | gpt-5.6-luna / xhigh (triple__luna__xhigh__c2r1) |
| judge confidence | high |
| authors would recognise it | yes |
The paper contains no numbered theorem, lemma, corollary, or proposition asserting a computational result, so bit (a) fails. The proposed cohort-based proxy model is a recognizable continuous extension, but it mirrors an axiomatic framework rather than a named computational result. The opponent therefore correctly applies ChoCo’s anchor requirement, even though its broader claim that no worthwhile extension exists is too strong.
fails bit a — no named computational result to mirror
No named computational result is covered; the proposed extension concerns ε-proportionality for cohort-based proxy or first-past-the-post mechanisms, while liquid democracy, sortition, and the paper’s remaining axiomatic challenges are left without computational mirrors.
The strongest honest positive case is limited: this paper is a promising source for a continuous *extension*, but it contains no qualifying computational anchor.
There is no numbered Theorem, Lemma, Corollary, or Proposition in the paper asserting a result such as membership in \(P\), NP-hardness, FPT, or W[1]-hardness. The paper presents a framework, defines mechanisms and axioms, and lists future challenges. Its references contain algorithmic results, but those are not results proved or stated as named computational results of this paper. Therefore there are no valid anchor-specific continuous problems to report, and no paper result that a mirror can formally cover.
The best available mirror would scale the paper’s illustrative framework to a genuine high-multiplicity electorate. Let \(\Theta\) be a finite set of complete citizen types, where a type records the issue profile and representation behaviour relevant to the model. Let \(\mu_\theta\) be the fraction of the population of type \(\theta\), and let \(g_{\theta c}\) be the probability that such a citizen supports or delegates to candidate \(c\). For a fixed candidate set \(C\),
\[ v_c=\sum_{\theta\in\Theta}\mu_\theta g_{\theta c} \]
is candidate \(c\)’s aggregate expected vote share. A continuous mechanism \(M\) returns a voting-weight vector \(w^M\). One could define the problem
\[ \textsc{Continuous Representation Error}(M): \]
given rational \(\mu\), rational \(g\), \(C\), and \(\varepsilon\), decide whether
\[ \max_{c\in C} \left| \frac{v_c}{\sum_{d\in C}v_d} - \frac{w^M_c}{\sum_{d\in C}w^M_d} \right| \le \varepsilon . \]
The corresponding optimization version asks for the mechanism in a specified class that minimizes this deviation. This is a recognizable population-continuous version of the paper’s \(\varepsilon\)-proportionality objective. The natural regime is a large electorate containing many repeated cohorts—say, citizens sharing region, issue preferences, and candidate-support probabilities—while \(m=|C|\) and \(\tau=|\Theta|\) remain comparatively small.
For direct, proxy, and a deterministic continuum limit of first-past-the-post, this problem would likely be Class A: the relevant quantities are finite weighted sums and comparisons. Proxy voting is especially clean, since \(w^P_c=v_c\). This gives a plausible computational research programme around the paper’s Challenge 1, but it is not a result of the paper and should not be presented as one.
The mirror becomes much weaker for liquid democracy. The original framework’s \(\Gamma\) is indexed by named agents and can encode delegation paths and cycles. A type marginal \(\mu\) and a type-level kernel \(g\) do not determine those structures. Preserving them would require enriching types with network position or delegation history, potentially destroying the intended compression. Sortition also requires care about whether candidate multiplicities and body size scale with the population.
Thus the positive claim is that the paper’s formal framework admits a sensible high-multiplicity computational extension, strongest for proxy/FPTP-style mechanisms. The weakest point—and ultimately the decisive limitation—is that this is a proposed extension of an axiomatic agenda, not a continuous mirror of any named computational result. Under the programme’s anchor requirement, the paper should therefore receive no qualifying positive mirror verdict.
The decisive negative is that this paper supplies nothing for ChoCo to continuize at the required level. It contains no numbered theorem, lemma, corollary, or proposition asserting a computational result. Its actual contributions are a framework, definitions, an example, and axiomatic research challenges. Continuizing \(\varepsilon\)-proportionality or \(\gamma\)-effectiveness would therefore continuize axioms, not a computational problem; that is explicitly outside ChoCo’s scope. There are consequently no valid anchors to defeat—the proponent effectively concedes this point.
The proposed \(\textsc{Continuous Representation Error}\) is also weaker than it first appears. For proxy voting, \(w^P_c=v_c\), so the normalized error is identically zero whenever the denominator is nonzero. Deterministic first-past-the-post reduces to comparing finitely many aggregate vote shares, and sortition gives fixed weights. These are legitimate arithmetic exercises, but they do not expose a computational question inherited from the paper. Optimizing over a “specified class” of mechanisms is either finite enumeration or an entirely new mechanism-design problem whose constraints and complexity are absent from the paper. This is not an objection that the answer might be in \(P\); a tractable continuous result would be valuable. The problem is that the substantive computational content would have to be invented rather than mirrored.
The strongest rescue is liquid democracy. One could replace named agents by repeated cohorts and represent delegation by a type-level kernel, or even by a graphon-like object. But the paper’s liquid-democracy quantity depends on transitive paths, delegation cycles, self-selection, and named endpoints. A marginal type distribution \( \mu \) and vote probabilities \(g_{\theta c}\) do not determine those structures. Enriching types enough to recover them largely restores individual network position; using a graphon or mean-field delegation process creates a new stochastic-network problem. If the body size \(k\) stays fixed, selected individuals have vanishing population mass; if \(k\) scales with the population, the object is no longer the paper’s finite representative body. These may be worthwhile new models, but they are not continuous mirrors of a result in this paper.
The honest limitation is that the universal claim is too strong in an unrestricted modelling sense: a cohort-based proxy-voting extension is a sensible high-multiplicity object and could motivate separate work. But under ChoCo’s stated criterion, this paper should be rejected as a target. The reason is not that every conceivable extension is trivial or impossible; it is that the paper has no qualifying computational result to mirror, and its most natural continuous reformulations merely restate or newly invent arithmetic and mechanism-design questions.
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.