| paper | d4-journals-scw-2001-0012 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorem 2 and Proposition 1 are named results, but they assert rule properties and an ultrafilter structure, not that an object can be computed or that computing it is hard. The proposed atomless extension remains an axiomatic existence question. The paper therefore has no computational anchor for a ChoCo mirror.
fails bit a — no named computational result to mirror
The proposed analogy covers only Theorem 2’s existence and coalitional-strategyproofness claim, with Proposition 1 as supporting structure; it leaves the oligarchy discussion, finite-person/state interpretation, and superrule suggestion aside.
The strongest positive case I can make is a continuous-population extension of Theorem 2, but it is not an eligible computational anchor under your rules.
Theorem 2, proved in this paper, says that for a countable Boolean algebra \(B\) on a countably infinite society, containing every finite coalition, the constructed rule \(G\) is onto, nondictatorial, and coalitionally strategyproof on the \(B\)-admissible profiles. It chooses \(x\) when the coalition whose members rank \(x\) first belongs to the constructed set \(U\). Proposition 1, also proved here, establishes that \(U\) is a free ultrafilter. These are the paper’s clearest named results, but neither asserts a complexity bound or solves a computational problem. So the paper has zero qualifying computational anchors.
If Theorem 2 is allowed as a non-computational source result, the most faithful continuous question I would put forward is Atomless Cohort Strategyproofness:
Take \(I=[0,1]\) with Lebesgue mass and a finite set \(X\) of at least three alternatives. Each location \(u\) has a strict ranking over \(X\); a society is a measurable ranking profile, understood up to changes on sets of mass zero. A type must retain both the ranking and its observable cohort or location, because the rule uses which coalition holds a ranking, not just how much mass holds it. A deviation reassigns reported rankings for a measurable coalition of positive mass, keeping locations fixed. The question is to construct an onto deterministic rule \(F\) such that no such coalition can make every member strictly better off. A solution is the rule and a proof of those properties.
There is a plausible route: take an ultrafilter \(U\) on the Boolean algebra of measurable cohorts modulo null sets, and choose \(x\) exactly when the cohort ranking \(x\) first belongs to \(U\). Since the top-choice cohorts partition the population, the ultrafilter selects exactly one; the same basic argument as in the paper gives coalitional strategyproofness. Null sets have no effect, so no single point dictates the outcome. The expected result is an existence theorem by the paper’s structural method, not a complexity classification.
This has some genuine appeal as a population mirror. The paper itself gives rational intervals as an example of describable coalitions and interprets the infinite society through states and spatial models. One can imagine many people distributed across cohorts, with mass recording cohort sizes. The mirror would cover Theorem 2’s existence and strategyproofness result only.
The weakness is decisive for ChoCo: the rule depends on which cohort has a ranking, not only on the ranking masses \(\mu_t\). Swapping the rankings on two equal-mass regions can leave every \(\mu_t\) unchanged while changing the selected winner. To preserve the rule, types must include cohort or location information; that is a substantial departure from a distribution over a fixed finite set of ranking types. More fundamentally, this is an existence question about a social choice rule, not a computational question. The paper gives no running time for evaluating \(G\), and membership in \(U\) is not supplied as a finite computational procedure. I therefore would not classify this candidate as tractable, hardness-transferring, or continuum-specifically hard.
So there is a plausible continuous analogue of the paper’s population model, and the authors might recognize its connection to their spatial and state-based interpretations. But under the stated anchor and scope requirements, it does not establish a ChoCo computational mirror. The mass-only model loses the cohort information the theorem relies on, and the closest faithful extension still asks an axiomatic existence question.
The strongest objection is at the programme’s entry gate: this paper gives no named computational result to mirror. Theorem 2 proves that a particular rule is nondictatorial and coalitionally strategyproof; Proposition 1 proves that its decisive coalitions form a free ultrafilter. Neither gives a complexity bound or solves a computational problem. The construction is “explicit” in a set-theoretic sense: enumerate \(B\), then accept a coalition if its intersection with the previously accepted coalitions is infinite. The paper supplies no finite input model or running time for that test. For some natural representations of \(B\), deciding whether a recursive set is infinite is itself undecidable. Remark 3 points toward computability analysis, but does not provide a result in it.
The proponent’s atomless extension is plausible as an axiomatic existence theorem. On \([0,1]\), one could use an ultrafilter on a countable algebra of rational intervals modulo null sets and select the alternative whose top-ranking region belongs to it. But that is still a question about existence and strategyproofness of a rule, not a computational question of the kind ChoCo studies.
The extension also exposes why a mass-only society is not an adequate input for this rule. An ultrafilter selects one cell from every finite partition, including a partition into \(n\) equal-mass intervals. It therefore contains decisive regions of mass at most \(1/n\) for every \(n\). With two equal regions carrying different top rankings, swapping their rankings preserves the distribution over rankings but can change the winner. To preserve the rule, the model must retain cohort or location information; the ballot-mass vector loses information the rule uses. In a natural control variant with cost proportional to altered mass, a target can be made the winner by changing a decisive region of arbitrarily small mass. The intervention cost has infimum zero, but no zero-cost intervention changes the outcome. Adding constraints to avoid that degeneration would define a new problem whose substance depends on those constraints and on the chosen ultrafilter.
I would not claim that no continuous axiomatic analogue exists; the proponent has sketched a credible one, and the paper itself points to spatial interpretations. The negative case is that this paper supplies no computational anchor, while its closest continuous extension remains axiomatic and its obvious mass-based computational variant either discards the rule’s cohort information or degenerates. That is a strong case against spending ChoCo’s effort here, though not a proof that no worthwhile computational question could be designed around the construction.
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.