| paper | d4-journals-mss-2022-0031 |
| 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 characterize and represent strategy-proof rules or convert between their descriptions; none asserts a computational result. The natural extension to masses is axiomatic, and unilateral strategy-proofness becomes vacuous for atomless voters, so no in-scope computational mirror survives.
fails bit a — no named computational result to mirror
The named results cover axiomatic characterization, representation, and conversion of anonymous strategy-proof rules; none supplies a computational result for a continuous population.
The paper’s strongest foothold for a positive case is its three preference types: prefer \(a\), prefer \(b\), or be indifferent. A plausible high-multiplicity setting would be recurring large referenda where many voters fall into those same three categories. But I cannot make that a case anchored as requested: the paper has no named computational result asserting tractability, hardness, or another complexity classification.
The named results are structural. Theorem 2.8 says an anonymous social choice function is strategy-proof exactly when its induced grid function is dually monotone. Theorem 3.1 says those dually monotone functions are exactly the functions represented by the paper’s \(\{a,b\}\)-lists; Theorem 1.1 states the corresponding representation for anonymous, strategy-proof functions. Theorem 4.1 gives formulas converting between that representation and extended majority quotas. None classifies the complexity of a computational problem. The paper’s mention of implementation code does not supply such a result, and the count of \(2^{n+1}\) functions is not a named complexity theorem here.
One might ask for a continuous anonymous, strategy-proof rule \(F\) over masses \(\mu\) on the three types. But with atomless voters, a unilateral report changes no mass, so individual strategy-proofness becomes vacuous. That candidate is also an axiomatic question, outside ChoCo’s computational scope. A rational-mass instance that can be scaled to a finite electorate instead remains the paper’s discrete model. So the paper offers an interesting structural starting point, but I do not see an honest, prover-ready continuous computational mirror anchored in its results.
The strongest case against a ChoCo mirror is that the paper has no named computational result to mirror. Theorem 2.8 characterizes strategy-proofness; Theorems 1.1 and 3.1 represent the resulting rules; Theorem 4.1 converts between two finite descriptions. None gives a complexity classification for a computational problem on a society. One could scan a finite grid to check dual monotonicity, but that straightforward verification is not the paper’s result. Turning rule selection or optimization into the target would add a new problem rather than continuize one of these theorems.
The best population setting is easy to find: large referenda with many voters in the same three preference categories. That makes high multiplicity sensible, but it does not supply the missing computational question. A natural continuous translation puts masses \((x,y,z)\) on a simplex and replaces the finite grid’s monotone regions and quota lists with regions and boundary curves. That is a coherent extension of the paper’s axiomatic geometry, which the programme explicitly places outside its computational scope.
There is also a deeper mismatch in the main property. In an atomless population, one voter’s report changes no mass, so individual strategy-proofness becomes vacuous. Letting a positive-mass bloc deviate would restore a meaningful change, but it asks about coalitional manipulation, which is a different property. The finite grid’s one-voter steps are central to the paper’s characterization; a continuum version must either lose that content or change the question.
The quota conversion formulas could likewise be normalized into real-valued thresholds, and a researcher could build a computational design problem around them. But the paper supplies no objective or algorithmic problem for that exercise. So the case is strong as a scope verdict: there is a plausible high-multiplicity regime and a natural continuous axiomatic picture, but no honest computational mirror anchored in the paper’s named results. It does not establish that no worthwhile adjacent project could ever be formulated.
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.