| paper | d4-journals-geb-2012-0062 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorem 1 is an axiomatic characterization, and the paper gives no named algorithmic or complexity result to mirror. The proposed mass-deviation question is statable, but it changes individual incentives into incentives for positive-mass coalitions.
fails bit a — no named computational result to mirror
The candidate extends Theorem 1 to mass deviations among single-peaked voter types; the paper's individual-agent characterization and other results receive no computational mirror.
The paper has no named computational result of the kind this task requires. Its main results are axiomatic characterizations: Theorem 1 (proved here) says that, on an intertwined domain, a social choice function is strategy-proof exactly when it satisfies monotonicity and reshuffling invariance. Proposition 3 (proved here) shows that single-peaked domains are intertwined. Proposition 1 (proved here) gives necessary conditions and a counterexample outside the universal domain. None asserts that a computational problem is in P, hard, FPT, or otherwise classifies its complexity. So there is no eligible anchor, and no compliant continuous problem per anchor to put forward.
The best positive lead is a population version of Theorem 1 for a large public-good electorate. Let \(A\) be a fixed finite ordered set of policy alternatives, \(D\) the single-peaked rankings on \(A\), and \(\mu\in\Delta(D)\) a rational distribution of voter types with support size \(\tau\). Here mass means the fraction of voters with each ranking. In a plausible regime, the electorate is large while \(\tau\) is small relative to its size. An anonymous rule is \(F:\Delta(D)\to A\).
One possible extension asks whether mass strategy-proofness is characterized by mass versions of monotonicity and reshuffling invariance. Define mass strategy-proofness to require that, for every \(\mu\), every \(t\) with \(\mu_t>0\), every misreport \(t'\), and every rational \(0<\varepsilon\leq\mu_t\), the outcome \(F(\mu)\) is weakly preferred under \(t\) to \(F(\mu-\varepsilon e_t+\varepsilon e_{t'})\). Define the two mass conditions by applying the paper’s corresponding preference transformation to \(t\), and requiring the transformed distribution’s outcome to remain in the original type’s indifference class of the original outcome. The question is whether those conditions characterize mass strategy-proofness on intertwined domains, including single-peaked ones. This is a concrete structural question, but it is an extension of the paper’s theorem, not a computational result anchored by it.
That distinction is also the weak point. In an atomless population, one individual has zero mass, so individual strategy-proofness can become vacuous; allowing a positive \(\varepsilon\) instead gives a coalition-of-types notion. The paper discusses group strategy-proofness, but it does not study this distributional characterization. Its results therefore offer a plausible starting point for a continuous-population extension, while the required complexity anchors—and thus a valid ChoCo mirror under this prompt—are absent.
The decisive objection is that the paper has no result for ChoCo to continuize. Theorem 1 characterizes strategy-proofness by two axioms on intertwined domains; Proposition 1 gives necessity, a universal-domain equivalence, and a counterexample; Proposition 3 shows that single-peaked domains are intertwined. None classifies the complexity of a computational problem or supplies an algorithmic task. The fact that a result is called a theorem does not make it a computational result.
The best mirror is the proponent’s single-peaked public-good electorate, with an anonymous rule \(F:\Delta(D)\to A\). But a literal individual deviation changes no mass in an atomless society, so individual strategy-proofness says nothing about \(F\). Their repair—allowing a transfer of any \(\varepsilon>0\) from type \(t\) to type \(t'\)—gives the deviator positive mass. That is a coalition deviation by a block of like-minded voters, not an individual deviation. It is a coherent new question, but it changes the strategic unit. The paper itself distinguishes individual from group strategy-proofness; its finite-agent results do not automatically characterize incentives for mass coalitions in a distributional rule.
The cleanest repair that preserves the paper’s individual incentive is to restrict \(\mu\) to empirical distributions with denominator \(n\). Then one voter’s deviation changes it by \(n^{-1}(e_{t'}-e_t)\), exactly reproducing the anonymous finite-\(n\) problem. That is a high-multiplicity encoding, but the continuous simplex has disappeared: the task remains checking the finite rule on its finite profile space. If instead \(F\) is defined over the whole simplex, a computational question needs a representation for \(F\). With an explicit finite table, checking incentives is an exhaustive finite check; with a succinct formula or circuit, the complexity depends on that chosen representation, which the paper does not specify.
Proposition 3 provides a plausible population regime, not another computational anchor: single-peaked voter types can be given positive population shares, but the proposition only establishes a domain property. Proposition 1’s small Borda counterexample could likewise be placed in a larger electorate, but scaling the behavioral example would not create a complexity result.
So the negative case is strong for ChoCo’s stated purpose: no proposed anchor yields a computational mirror without adding a new, representation-dependent problem. It is weaker as a claim that no continuous question here could be worthwhile at all. The mass-coalition characterization suggested by Theorem 1 may be a worthwhile axiomatic extension; it simply is not a computational continuization of a result in this 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.