| paper | d4-conf-aaai-2010-0199 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | no |
Proposition 1 is a genuine computational result, but its state compression depends on the order of individual strategic moves. The proposed construction asks which winner recurs across finite games whose lengths grow with \(k\); it does not define the game on the stated mass distribution. The case acknowledges that turn positions matter, but treating the cohort schedule as fixed does not resolve that mismatch.
fails bit b-changes — the continuum limit changes the question
A single move can permanently change the nominee even as its share tends to zero, and each move's continuation depends on its position; fixing cohort proportions therefore still produces a sequence of atomic games, not a mass-based backward-induction game.
fatal: True
The case anchors only Proposition 1; it leaves Theorem 1, Corollary 1, Propositions 3–5, and the simulation findings outside the proposed mirror.
The strongest positive case is Proposition 1, proved in this paper. It says that for any finite preference profile, the backward-induction winner under the nomination rule, \(\mathrm{SG}_{\mathrm{Nom}}(P)\), can be computed in polynomial time and space using Algorithm 1 with the nomination compilation function. Under that rule, each voter’s top-ranked alternative is nominated, and the winner is the nominated alternative earliest in a fixed priority order. The paper’s key compression is that the game state can be summarized by the earliest-priority alternative nominated so far. This is an algorithmic anchor; the paper gives no comparable numbered hardness result to anchor instead.
A continuous analogue I would hand to a prover is High-Multiplicity Nomination Limit. Its instance is a fixed alternative set \(X\), the rule’s fixed priority order, and an ordered list of \(\tau\) cohorts \((V_j,\mu_j)\), where \(V_j\) is a strict ranking and the positive rational masses sum to one. The order of cohorts is part of the instance because turn order matters. Let \(q\) be a common denominator of the masses and \(a_j=q\mu_j\). For each positive integer \(k\), form a finite game with \(k a_j\) voters of ranking \(V_j\), in cohort order. Voters retain the paper’s actions—reporting a full ranking—and its ordinal utilities, complete information, sequential observation, and backward induction. Write \(w_k\) for the game’s backward-induction winner. The problem is to output
\[
\mathcal W_\infty=\{c\in X : w_k=c\text{ for infinitely many }k\}.
\]
This is a direct question about the winner as the population grows while its type masses stay fixed. If the set is a singleton, the winner eventually stabilizes; if it is not, the recurrent set records the failure of a single limiting winner.
The regime is a large serial-ballot organization with a fixed number of ordered waves and relatively few recurring ranking archetypes in each wave. The electorate grows while the proportions assigned to those cohorts stay constant, so the number of voters grows and \(\tau\) stays fixed. The scenario retains the paper’s complete-information assumption. A cohort’s mass is meaningful because increasing it adds more sequential strategic turns, even though the nomination rule itself only records whether a candidate has been nominated.
I expect this mirror to be tractable when parameterized by \(m=|X|\), though I would not claim a polynomial-time bound in variable \(m\). For the nomination rule, a continuation state can be represented by a map from the \(m\) possible current nominees plus a “none yet” state to a winner. Each ranking induces a deterministic operator on these maps. There are at most \(m^{m+1}\) such maps, so repeated applications of an operator are eventually periodic. In the scaled cohort instance, each cohort’s operator is applied \(k a_j\) times; consequently, the winner sequence is eventually periodic in \(k\). A finite-state argument should therefore give an FPT algorithm in \(m\), with polynomial dependence on \(\tau\) and the input bit length. That expectation extends Proposition 1’s compressed-state idea; it is not a result proved in the paper. Further questions are whether the dependence on \(m\) can be improved to a polynomial, what periods can occur, and when the recurrent set must be a singleton.
My weakest point is the order structure. A distribution over rankings alone loses the sequence information that defines this game. The mirror keeps an ordered cohort schedule, and voters within a cohort still occupy different turns; if turn position must count as part of each voter’s complete type, the support no longer stays small as the electorate grows. The case rests on treating the cohort schedule as a fixed part of the game instance while the population itself is continuized. That makes this a credible scaling mirror of Proposition 1, but a narrower one than a continuous game defined by ranking masses alone. It covers Proposition 1 only; the paper’s paradox results and simulations are not needed to make this case.
The anchor is real: Proposition 1 proves that \(\mathrm{SG}_{\mathrm{Nom}}(P)\) is computable in polynomial time. The difficulty is that the proposition’s compression is about an ordered stream of strategic moves, not an aggregate distribution of voters. Its state records the earliest-priority candidate nominated so far; each next voter can change that state with one action, and the backward-induction outcome depends on who moves next.
A distribution over rankings discards that order. Adding a continuous time coordinate does not preserve the game in the usual way: an atomless population has no last voter from whom to start backward induction, and a single voter has zero mass. But under nomination, one voter can permanently change the nominee. For example, a single report nominating a candidate earlier in the fixed priority order can change the winner, even as that voter’s \(1/N\) share vanishes. Replacing “at least one nomination” with “positive mass nominates” makes the mass model insensitive to that move; treating the voter as pivotal retains an atom. Either choice loses a feature of the paper’s game.
The proposed cohort scaling preserves the finite game by keeping an ordered schedule and multiplying each cohort’s size by \(k\). That is the best version of the mirror, but it leaves the central problem intact: agents in a cohort share a ranking, yet their positions give them different continuation games. Position is part of what the problem uses, so cohort ranking alone is not a complete type. Keeping position means the number of strategically distinct roles grows with the population. The recurrent-winner question is then a question about repeated finite game sequences. It may be a sensible asymptotic question, but the cohort masses serve as instructions for constructing integer-length move sequences; they do not yield a population distribution on which the game itself is defined.
So I would reject Proposition 1 as a convincing ChoCo mirror on the evidence here. The objection is the absence of a continuous-population game that preserves both pivotal individual actions and sequential backward induction—not whether the proposed recurrent set is easy to compute or what it contains. The negative case has a real limit: an ordered-cohort scaling might still be worth studying if the authors regard that asymptotic model as their problem. I cannot rule that out universally, but it would need a separate justification as a continuization of the population rather than merely a scaling of the move sequence.
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.