| paper | d4-conf-aaai-2013-0188 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The named results bound the quality of equilibria reached by best-response dynamics; they do not assert an algorithm, a complexity bound, or computational hardness. The natural atomless limit also makes an individual's deviation zero-mass, while allowing a positive-mass group to move changes the unilateral game; the decisive failure is the absence of an eligible computational anchor.
fails bit a — no named computational result to mirror
No result is covered by a continuous mirror: Theorem 9 bounds Borda's dynamic price of anarchy, Theorem 7 gives a veto lower bound, and Theorem 3 gives a plurality bound, but none is a computational result under the stated criterion.
The paper has no named computational-complexity result of the kind your anchor rule requires. Its theorems concern the quality of outcomes under best-response dynamics, not whether a problem is in P, NP-hard, FPT, or similar. I therefore can’t honestly offer a qualifying anchor or a continuous problem “per anchor.”
The closest result is Theorem 9, proved in this paper: for Borda with \(m\ge 4\) alternatives and \(n\) agents, the dynamic price of anarchy is \(\Omega(n)\). More specifically, for every \(m\ge4\) and infinitely many \(n\), there is a truthful profile and a best-response sequence from it ending at a Nash equilibrium whose ratio is at least \(\Omega(n)\). The proof is deferred to the full version. Theorem 7, also proved here, gives an \(\Omega(m)\) lower bound for veto when \(m\ge4\); Theorem 3 proves additive DPoA exactly \(1\) for plurality. None is a computational-complexity classification. The cited lemmas are attributed to Reyhani and Wilson, but they concern best-response dynamics, not complexity either.
There is a plausible population regime behind a *different* question: a large electorate with relatively few distinct rankings. A type would be a voter’s complete true ranking, \(\mu_t\) its fraction of the electorate, and the action state a distribution of reported rankings for each true type. One could ask whether Borda dynamics can reach an equilibrium whose winner has a low truthful Borda score. That mirrors the subject of Theorem 9, but it is not anchored by a qualifying computational result.
Its main modeling problem is that the paper’s moves are unilateral and can change the winner. In an atomless continuum, one voter has zero mass and cannot change any score or outcome. The natural infinitesimal best-response dynamics therefore lose the pivotal moves that drive the finite result; allowing positive-mass groups to move together would change the paper’s unilateral-deviation model. A high-multiplicity finite version could retain those moves, but it would not itself be the continuous-population mirror required here.
So the strongest honest positive case is only that the electorate has a credible many-voters/few-types regime. The paper offers no qualifying computational anchor, and the nearest candidate, Theorem 9, has a serious obstacle to faithful continuization.
There is no qualifying computational result here to anchor. Theorem 9 bounds the dynamic price of anarchy for Borda by \(\Omega(n)\); Theorems 3, 5, and 7 give other outcome-quality bounds. None classifies the complexity of a computational problem or gives an algorithm. A question about computing whether a bad equilibrium is reachable would be a new problem inspired by Theorem 9, not a continuous mirror of a computational result in the paper.
Theorem 9 is still the strongest candidate, and the proponent is right that large electorates with few ranking types are a sensible high-multiplicity regime. But that does not preserve the mechanism the theorem studies. The state can be represented by a distribution over true and reported rankings; an individual deviation moves one voter between reports. In an atomless society, that voter has mass zero, so the score vector and winner do not change. There is no strict improvement move from the truthful state. This affects the plurality and veto results too: their bounds also depend on unilateral moves changing election outcomes.
A more substantial mirror could let a positive mass of voters with the same ranking change reports together. That preserves winner-changing moves, but the mover is now a coordinated group, not the individual making a unilateral best response. Alternatively, one could retain moves of size \(1/n\), but then the pivotal unit is still a discrete voter; the population distribution is just a compressed representation of the finite game. Neither version mirrors this paper’s dynamic price of anarchy. High-multiplicity work would support the plausibility of that finite regime, as the programme requires, but would not supply the missing continuous dynamics.
This is a strong negative case, not a proof that no related project could be worthwhile. A computational study of mass-coordinated revision might be interesting, but it would need a new behavioral model and a new result to anchor it. On the paper’s stated model and results, the continuous population erases the unilateral pivotal action that gives the theorems their subject.
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.