| paper | d4-conf-sagt-2015-0012 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | unclear |
Corollary 2 is a computational anchor, and its mass version is stated concretely with a plausible link to finite profiles. But ordinary atomless Nash removes the individual pivotality behind the theorem, while the proposed boundary-sensitive deviation restores it through a new equilibrium convention. Whether the authors would recognize that convention as an extension of their PNE problem remains unsettled.
fails bit b-changes — the continuum limit changes the question
The paper gives no reason to prefer this custom boundary-sensitive concept over standard atomless Nash, so a coherent finite-game limit alone does not establish that the authors would recognize it as their problem.
fatal: False
The undecided point is whether the authors would accept vanishing-agent deviations at exact ties as a continuous analogue of their unilateral PNE deviations; ordinary atomless Nash makes TIENE trivial. Their acceptance of this solution concept would settle the grade green, while rejection would make this anchor fail bit (b).
The proposed mirror covers the tied-equilibrium target-membership problem in Corollary 2 for lazy voters with random-candidate tie-breaking; it leaves the other voter types, tie-breaking rules, equilibrium questions, and the paper’s comparisons and price-of-anarchy results aside.
My lead is Lazy Random-Candidate Continuous TIENE: given a continuous society and a target candidate, decide whether the target can belong to a tied winning set at a lazy-voter equilibrium.
The anchor is Corollary 2. It says that for lazy voters and either random-candidate or random-voter tie-breaking, EXISTNE and TIENE are NP-complete, while SINGLENE is in P. The paper proves the equilibrium characterization in Theorem 2 and states this classification in Corollary 2; the NP-hardness of the relevant tied-equilibrium condition, including membership of a specified candidate in such a tie, is credited to Desmedt and Elkind [6]. I rely on the TIENE hardness for random-candidate tie-breaking.
Here is the continuous problem. An instance has candidates \(C\), a target \(c^\star\), and a finite support \(T\) of complete voter types. Each type \(t\) has the paper’s strict ranking and cardinal utility vector \(u_t\), and has rational mass \(\mu_t>0\), with \(\sum_{t\in T}\mu_t=1\). Let \(\tau=|T|\). An action allocation is \(x_{t,a}\ge 0\), for each type \(t\) and ballot \(a\in C\cup\{\bot\}\), with \(\sum_a x_{t,a}=\mu_t\). Candidate \(c\)’s score is \(s_c(x)=\sum_t x_{t,c}\); the random-candidate rule chooses uniformly from the maximum-score set \(W(x)\).
To preserve the paper’s pivotal-voter question at a continuum tie, use a vanishing-agent equilibrium: a type-\(t\) voter currently taking an action with positive mass may shift an arbitrarily small mass \(\delta\) from that action to another, and we compare the resulting random-candidate lottery in the right-hand limit as \(\delta\downarrow0\). Abstention retains the paper’s secondary preference when the outcome utility is unchanged. The question asks whether there is such an equilibrium with \(|W(x)|\ge2\) and \(c^\star\in W(x)\); a solution is the allocation \(x\).
For tied equilibria, the corresponding mass condition is particularly concrete. A witness can be given as a set \(X\subseteq C\), with \(c^\star\in X\) and \(k=|X|\ge2\). Write \(\operatorname{top}_X(t)\) for type \(t\)’s favourite candidate in \(X\). The conditions are
\[ \sum_{t:\operatorname{top}_X(t)=c}\mu_t=\frac1k \quad\text{for every }c\in X, \]
and, for every type \(t\),
\[ \frac1k\sum_{c\in X}u_t(c) \;\ge\; \max_{d\in X\setminus\{\operatorname{top}_X(t)\}}u_t(d). \]
The allocation votes all of type \(t\)’s mass for \(\operatorname{top}_X(t)\), with no abstentions. These conditions are the mass version of condition (3) in Theorem 2: each tied candidate receives an equal share, each type votes for its favourite among the tied candidates, and its utility from the tie lottery beats any unilateral deviation that would elect another tied candidate. The finite theorem’s additional requirement \(n/k\ge2\) becomes automatic for positive masses in a large-population regime. Its separate “at most one voter per top candidate” case is a small-electorate pattern, not the high-multiplicity regime this mirror targets.
This is a plausible regime when a very large organization or electorate has many members in repeated preference-and-valuation cohorts, and members are lazy in the paper’s sense. The number of agents can be enormous while \(\tau\) stays comparatively small. Type must include the complete utility vector, not just the ranking. The authors should recognize the question: the ballots, tie rule, utilities, and best-response test are theirs; the change is from voter counts to population shares, evaluated at the limit of a single voter’s pivotal deviation.
I expect hardness to transfer for this problem. For an explicit finite profile, set \(\mu_t\) to the fraction of voters with type \(t\). The mass equalities above are then exactly the equal group-size conditions in Theorem 2, after identical voters are aggregated. The paper reports that checking condition (3), including whether a specified candidate can belong to such a set \(X\), is NP-hard [6]. A witness \(X\) can be checked using rational arithmetic in \(m,\tau,L\), so this continuous problem has a short certificate as well. This is the Class B story: the combinatorics are in choosing \(X\) and balancing types across it, not in treating each voter as an indivisible unit. I would still ask whether the problem is tractable for fixed \(\tau\), and how its complexity depends on \(m\) and \(\tau\); the paper does not settle those parameterized questions.
The weak point is the equilibrium concept. Under ordinary nonatomic Nash equilibrium, a single voter has zero mass and cannot change the outcome; the strategic pivotality that drives this paper’s results disappears. The vanishing-agent test preserves pivotality exactly at tied score boundaries, making this a limit of finite PNE rather than the default atomless-game convention. That is the point a referee may challenge. The mirror stands or falls on whether the authors accept this boundary-sensitive limit as the continuous form of their single-voter deviation.
The strongest objection to the Corollary 2 anchor is that the paper’s hardness is about individual pivotality, while an ordinary continuous population has no pivotal individual. In an atomless Nash model, one voter’s deviation changes no mass and no score. For lazy voters, abstaining is then strictly preferred whenever the outcome is unchanged, so everyone abstains; every candidate ties, and Lazy Random-Candidate TIENE is trivially yes for any target. That is a degenerate mirror of the paper’s equilibrium question.
The proposed vanishing-agent test repairs this by letting an arbitrarily small positive mass switch ballots and taking the right-hand limit. At an exact tie, that perturbation can change the lottery from a uniform tie to a certain winner. But this is not an ordinary unilateral deviation by an atomless voter: it is a type-level perturbation that gives a vanishing group a finite effect on the outcome. Choosing that boundary rule adds a new equilibrium concept. A different, equally standard choice—atomless Nash—erases the pivotality on which Theorem 2 and Corollary 2 rely. The continuous society alone does not select between them.
That objection does not defeat the best version of the mirror. The boundary rule is coherent as a limit of finite games, where one voter’s mass tends to zero while their deviation can still break an exact tie. And a large electorate with repeated ranking-and-utility types is a plausible high-multiplicity regime; the type space must include the full utility vector, but that is consistent with the paper. The resulting question could be worthwhile if the authors accept this limit notion.
So the negative case is weak where the prompt demands it be strongest: I cannot honestly rule out a useful continuous mirror in any scenario. The defensible objection is narrower: the proponent has proposed one particular limit equilibrium, not established that it is the continuous form of the paper’s PNE. If the authors accept that boundary-sensitive concept, this anchor survives.
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.