| paper | Characterizations of Sequential Valuation Rules |
| authors | — |
| venue | AAMAS 2023 |
| filed under | multiwinner · multiwinner |
| judged by | gpt-5.6-terra / high (triple__gpt-5.6-terra__high__ctx2r8-rejudge1) |
| judge confidence | high |
| authors would recognise it | no |
The paper's numbered results are axiomatic characterizations rather than assertions about the complexity or algorithms of a computational problem. The proposed distributional seqPAV evaluation task is natural, but it is a new downstream problem about a rule characterized in the paper, not a continuization of a named result of this paper. Replacing voter counts by masses in Theorem 4 remains outside ChoCo's computational scope.
fails bit a — no named computational result to mirror
The paper's characterizations, including Theorem 4, are left without a qualifying computational mirror.
This paper contains no named computational-complexity result to anchor a continuization verdict. Its numbered results—Propositions 1–4, Theorem 1, Corollary 1, and Theorems 2–4—are axiomatic characterizations, proved here, not claims of polynomial-time solvability, NP-hardness, FPT, approximation, or similar. The introduction’s statement that sequential rules are “easy to compute” is informal; the NP-hardness reference concerns optimizing Thiele rules and is cited from elsewhere, without a named computational theorem in this paper.
So there is no qualifying paper-result-anchored continuous computational mirror, and hence no Class A/B/C prediction to make for one of this paper’s results. Its “continuity” axiom is also the overwhelming-majority/replication condition, not a continuous-population model.
The strongest honest positive case, if one permits a natural downstream computational question about the rules characterized here, is sequential PAV. Let types be nonempty approval ballots \(S\subseteq C\), and let \(\mu_S\) be the fraction of a large electorate casting \(S\). At a partial committee \(W\), seqPAV assigns an unelected candidate \(c\) marginal mass-score
\[ M(c\mid W,\mu)=\sum_{S\ni c}\frac{\mu_S}{|S\cap W|+1}. \]
Continuous seqPAV selection asks, given rational \(\mu\), committee size \(k\), and a specified tie-breaking rule, to construct the \(k\)-member committee obtained by repeatedly selecting a candidate of maximum \(M(c\mid W,\mu)\). The decision variable is the sequential committee path; each step maximizes the displayed marginal score. This is a very natural high-multiplicity object: think of a national members’ assembly, large union, or platform-wide participatory shortlist in which many people share one of comparatively few standardized approval bundles. Here \(n\) may be millions while the occupied ballot types are far fewer than voters.
It is a clean Class A problem: with the support of \(\mu\) explicit, greedy evaluation takes \(O(km\tau)\) arithmetic operations. This is not a new consequence of the paper, however; it merely makes its central rule computationally meaningful on a population distribution.
The closest named anchor would be Theorem 4, proved here: “seqPAV is the only sequential Thiele rule that satisfies clone-proportionality” for \(m\ge3\). Its population-continuous analogue is immediate—replace the two voter counts in the clone-proportionality test by masses \(p\) and \(q\), retaining the comparison \(p/k\) versus \(q\). Rational discrete profiles embed by normalization, and the theorem’s score comparisons extend linearly to real masses. But that is an axiomatic statement, outside ChoCo’s computational scope, so it cannot serve as the required anchor.
The weak point is decisive: this is a paper about characterizing rules, not about computational problems posed on instances. A continuous society is highly plausible for applying seqPAV, but it does not turn any theorem in this paper into the kind of computational mirror ChoCo is meant to classify.
The strongest negative case is procedural and decisive for this paper: none of its numbered results is computational. Propositions 1–4 and Theorems 1–4 characterize classes of rules by axioms; they do not state a complexity, algorithmic, approximation, or robustness problem. The paper’s “continuity” is replication/overwhelming-majority continuity, not a continuous-population model. Thus there is no paper-result-anchored ChoCo mirror to classify.
This defeats the proposed Theorem 4 “anchor” completely: replacing \(n_1,n_2\) by real masses merely extends clone-proportionality as an axiom. It remains an axiomatic characterization, explicitly outside the programme’s computational scope.
The proposed continuous seqPAV-selection problem also cannot rescue an anchor. It is a downstream application of a named rule, not a computational result asserted by this paper; the paper neither poses nor studies this distribution-input problem. Calling it a mirror of Theorem 4 would conflate “a rule characterized here can be evaluated on compressed ballot counts” with “this paper contains a computational question to continuize.” Those are different claims.
That said, the universal substantive negative becomes weak if the remit permits freely inventing downstream questions. A population distribution over approval ballots is an exceptionally natural high-multiplicity object for a large committee election, and seqPAV’s marginal-score computation transfers to it without losing relevant agent information. One could then ask genuinely ChoCo-style questions—mass bribery, campaign influence, winner robustness—about seqPAV, though those would be new problems prompted by the rule rather than continuizations of this paper’s results. I would therefore reject this paper as an anchor for the programme, but not claim that sequential approval committees admit no worthwhile continuous computational research at all.
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.