| paper | d4-conf-aldt-2021-0008 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | yes |
The Kemeny corollaries characterize convergence and duration for a specified finite-agent deliberation process; they do not establish a computational result under the stated anchor criterion. A continuous population of rankings is a plausible mirror, but that plausibility cannot supply the missing computational character.
fails bit a — no named computational result to mirror
The proposed mirror covers the Kemeny convergence and round-count results in Corollaries 24–25; it leaves the Euclidean, hypercube, and other ordinal-rule results aside.
There is no named result in this paper that classifies a computational problem as polynomial-time solvable, NP-hard, fixed-parameter tractable, or similar. Its theorems analyze convergence of an iterative process. That leaves no fully qualifying computational anchor under the requested standard.
The closest basis for a positive case is the ordinal Kemeny result. Corollary 24, proved here via Theorem 4, says that deliberation over rankings using swap distance and Kemeny is guaranteed to converge. Corollary 25, proved here via Theorem 3, says the final Kemeny ranking is the initial winner \(w_0\), and convergence takes exactly \(\max_{v\in V^0}\lceil d(v,w_0)/\epsilon\rceil\) iterations. These are useful, precise dynamic results, but they do not classify the computational complexity of a problem.
A natural high-multiplicity scenario is a large consultation or deliberating organization where many participants share the same current ranking and the number \(\tau\) of distinct rankings is much smaller than the population. Each type is a ranking \(r\); its mass \(\mu_r\) is the fraction of participants holding it. This makes the population continuous while keeping each individual’s opinion an ordinary ranking.
The resulting HM-Kemeny Deliberation problem would take a candidate set \(C\), a rational distribution \(\mu\) over at most \(\tau\) rankings, an integer \(\epsilon>0\), and a fixed tie-breaking order. In each round, choose a Kemeny ranking \(w\) minimizing \(\sum_r\mu_r d_K(r,w)\), then transfer mass \(x_{r,s}\) from ranking \(r\) to ranking \(s\), with \(\sum_s x_{r,s}=\mu_r\). If \(d_K(r,w)>\epsilon\), mass may move only to \(s\) with \(d_K(s,w)=d_K(r,w)-\epsilon\) and \(d_K(r,s)=\epsilon\); if \(d_K(r,w)\le\epsilon\), it must move to \(w\). The task is to decide whether every legal sequence reaches consensus and, if so, return the consensus ranking and exact number of rounds. The continuous analogue predicts that every sequence ends at the initial Kemeny ranking \(w_0\), after exactly \(\max_{r:\mu_r>0}\lceil d_K(r,w_0)/\epsilon\rceil\) rounds.
For computing that answer, I expect hardness to transfer: setting \(\mu_r\) to each ranking’s count divided by the electorate size embeds an ordinary discrete profile. Once \(w_0\) is known, the iteration bound is straightforward to calculate. This covers the Kemeny convergence results only, not the paper’s other metric spaces and rules.
The weak point is decisive for the requested framing: the proposed computational problem adds a complexity question the paper did not study. Its named results establish a natural continuous-population dynamic, but they do not supply a computational-complexity anchor for a ChoCo mirror.
The strongest case against a ChoCo mirror is an anchor problem. Corollaries 24–25 prove convergence and give the number of deliberation rounds, assuming the initial Kemeny winner is known. They do not classify the complexity of a computational problem. The rounds are a property of the dynamics, not a running-time bound for an algorithm. Under ChoCo’s stated standard, that leaves no named computational result to mirror.
That does not make the proposed population model implausible. A large consultation with many people sharing rankings is a sensible high-multiplicity setting. Ranking is a complete type for this process: the movement constraints depend on a person’s current ranking and the current winner, not their identity. A mass can split among legal moves, so a transfer model can represent the allowed individual paths. Keeping \(\epsilon\) integral is also natural for swap distance; the population can still be continuous.
The proposed task—compute the terminal ranking and round count from rational masses—is therefore coherent. But it is a new computational question built around the paper’s dynamics, not a complexity result the paper establishes. Asking for full paths or transition policies would add a richer problem, but it would no longer mirror Corollaries 24–25, whose result abstracts away from those choices.
So I can argue against treating this paper as a strong ChoCo target under the programme’s computational-anchor criterion. I cannot honestly argue that no worthwhile continuous mirror exists in any scenario: the Kemeny mass model survives as a plausible research question. The negative case is strong on fit to the paper’s results, but weak as a universal objection to the mirror itself.
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.