| paper | Axiomatic characterization of committee scoring rules |
| authors | P. Skowron, Piotr Faliszewski, A. Slinko |
| venue | JET 2019 |
| filed under | multiwinner · multiwinner |
| judged by | gpt-5.6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | yes |
The proposed continuous committee-winner problem is a sensible high-multiplicity formulation over a distribution of ranking types. However, neither named theorem supplies a computational result to mirror, and importing winner computation would create a new problem rather than continuize a result of this paper. The missing computational anchor is fatal under the programme's rules.
fails bit a — no named computational result to mirror
The proposed formulation covers continuous winner computation for committee-scoring rules, while leaving the paper's axiomatic characterizations, decision rules, and proof machinery outside the computational mirror.
On a strict reading, this paper has no eligible computational anchor. Its main named results are Theorem A and Theorem B, both proved here, but both are axiomatic characterizations:
Neither theorem proves tractability, hardness, parameterized complexity, or an algorithm. The paper’s references to NP-hardness belong to cited prior work and are not stated as numbered results here. Thus the strongest honest positive case is necessarily conditional: a natural continuous-population problem can be extracted from the underlying committee-selection problem, but it is not anchored by a computational theorem of this paper.
The best candidate is Continuous Committee-Scoring Winner. Let \(A\) be \(m\) candidates, let \(k\) be the committee size, and let each voter type be a complete ranking \(\pi\in S_m\). The society is a rational distribution \(\mu=(\mu_\pi)_{\pi\in S_m}\), where \(\mu_\pi\) is the fraction of voters of type \(\pi\). Let \(\lambda\) be a committee scoring function, mapping each \(k\)-set of positions to a rational score. The action is to choose a committee \(C\in\binom{A}{k}\), with objective
\[ \operatorname{Score}_\mu(C) = \sum_{\pi\in S_m} \mu_\pi\,\lambda(\operatorname{pos}_\pi(C)). \]
The solution is the complete set of committees maximizing this score.
This is a genuine population continuization: the types are rankings, mass is the fraction of society holding each ranking, and the decision is the selected committee. The natural regime is a large parliamentary electorate, shortlist population, or product-recommendation market with \(n\gg\tau\) agents but only \(\tau\) recurring preference archetypes. A finite profile with \(n_\pi\) voters of type \(\pi\) becomes \(\mu_\pi=n_\pi/n\), so the mirror is exactly its high-multiplicity normalization.
Theorem A makes this model recognizable to the authors. It says that the four axioms force precisely this additive, position-based score representation. The paper does not already study the continuous population: its “continuity” is an Archimedean cloning axiom, and its later use of \(\mathbb{Q}^{m!}\) and fractional or negative voting situations is an algebraic proof device, not a society represented by a distribution. Hence there is no novelty collision.
For this extracted problem, I would expect a mixed landscape. SNTV, Bloc, and \(k\)-Borda are Class A because their committee scores decompose into candidate scores, so one selects the \(k\) highest-scoring candidates. More expressive rules, such as Chamberlin–Courant-style scoring, are likely Class B when their hardness comes from committee structure or the number of candidates rather than voter multiplicity. The continuous formulation would then clarify whether any hardness genuinely disappears when repeated voters are represented by mass. Further questions include algorithms when \(\mu\) is implicit, pricing over exponentially many rankings, and approximation or rounding back to an \(n\)-voter election.
The weakest point is decisive: this is a plausible continuous analogue of the paper’s underlying election problem, but not of a named computational result. The paper characterizes which aggregators are scoring rules; it does not analyze computing their winners. Therefore this is a defensible model-level positive case, but under the programme’s anchor requirement the correct verdict is that the paper supplies no computational mirror anchor.
The strongest case against the proposed mirror is decisive under ChoCo’s rules: this paper contains no eligible computational result to continuize. Theorem A and Theorem B are axiomatic characterizations. They assert that certain axioms characterize committee-scoring and decision-scoring rules; they do not state an algorithm, complexity bound, hardness result, approximation theorem, or parameterized result. The computational claims mentioned in Section 2 belong to cited papers, not to this paper’s results.
“Continuous Committee-Scoring Winner” is therefore a new problem attached to the paper’s subject matter, not a mirror of any named theorem. Given a distribution \(\mu\), computing
\[ \arg\max_{C\in\binom{A}{k}} \sum_{\pi\in S_m}\mu_\pi\lambda(\operatorname{pos}_\pi(C)) \]
is perfectly sensible, and the parliamentary high-multiplicity story is plausible. But those facts establish only that a continuous winner problem can be formulated. They do not connect it to a computational claim made by this paper. The same problem could be extracted from almost any paper introducing or characterizing a multiwinner rule.
The stronger versions do not repair this. One could study arbitrary committee-scoring functions, implicit type distributions, pricing over rankings, rounding, or the high-multiplicity relationship to finite elections. Those may become worthwhile ChoCo projects, but they are new algorithmic investigations rather than continuizations of Theorem A or Theorem B. Alternatively, one could continuize the axioms themselves by replacing finite profiles with distributions and expectations, but that is precisely the programme’s excluded axiomatic continuization, not a computational-population mirror.
Nor do the paper’s fractional and negative “voting situations” provide a hidden computational anchor. They are algebraic proof devices used to obtain hyperplanes and extend rules to \(\mathbb{Q}^{m!}\); the paper does not treat them as societies, optimize over them, or classify the complexity of any problem on them. Likewise, the paper’s cloning-based “continuity” axiom is Archimedean, not a continuous population model.
Thus the proposed mirror is a respectable research direction, and its high-multiplicity interpretation is not defective. The problem is more fundamental: the paper supplies no computational theorem for it to mirror. Under ChoCo’s stated anchor requirement, no choice of type space or population scenario can turn this axiomatic paper into a computational continuization without importing a new problem from outside the paper.
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.