| paper | d4-journals-geb-2026-0007 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
The numbered propositions establish potential existence and classification, core stability, and improvement-path properties, but make no algorithmic or complexity claim. A type-based mass-matching problem could be a plausible new extension, but it has no computational result in this paper to anchor a mirror.
fails bit a — no named computational result to mirror
No computational result is covered: the paper's matching, vote-trading, and pillage results characterize potentials and stability properties.
I can’t give a valid positive case under the required anchor rule: the paper contains no named computational result. Its numbered propositions characterize which social environments admit strong or weak potentials, and what those potentials imply for improvement paths. They do not classify an algorithmic problem as tractable or hard, or present an algorithm or encoding used to compute a solution.
The closest temptation is Proposition 6.3, proved here: for pillage games with gang formation and \(n\ge3\), the environment has a strong coalitional best reply potential, but no strong better reply potential. That is a structural stability result, not a computational result, so it cannot anchor a ChoCo mirror. The same issue applies to results about matching, vote trading, and the other pillage variants.
A continuum-agent version of one of these models might be worth studying, but it would need a new model of mass coalitions and their effectivity. The paper’s real-valued wealth allocations continuize the state, while the population remains a finite set of named individuals. That would be a new extension rather than a continuous-population mirror of a computational result in this paper.
The supplied “CASE FOR” does not actually offer a continuous mirror; it argues that none is anchored in the paper. On ChoCo’s stated criterion, that is the strongest objection: the paper has no named computational result to continuize. Its propositions characterize which environments admit potentials and what follows for core existence or improvement paths. They do not define an algorithmic problem with an input representation and a complexity or algorithmic result. Proposition 6.3, for example, classifies potential properties of finite gang-pillage environments. A continuous version of that proposition would still be a structural stability question, not a computational mirror.
The best rescue is to use the paper’s matching application: give each side a finite set of preference types, represent the population by type masses, and ask for a stable mass matching. That is a plausible high-multiplicity regime, and it could motivate worthwhile computational research. But the paper’s Proposition 5.4 establishes an improving path to a stable matching; it does not analyze the complexity of finding one. Defining a mass-matching problem and studying its algorithms would therefore be a new extension, not a mirror of a computational result in this paper. The same gap applies to vote trading and pillage games.
The gang-pillage result also resists a direct population translation: its state includes a finite partition of named players, and the potential uses \(|\pi|\). With nonatomic agents, a partition could have infinitely many gangs, making that term unsuitable without further restrictions. One could impose a finite gang structure, but that would be another modeling choice, still without a computational result here to anchor it.
So the negative case is strongest as a claim about this paper’s fit for ChoCo, not as proof that no useful continuum model can be built from its examples. Continuous type-based matching may be worthwhile research. The point is that it would start a new computational agenda rather than continuize a computational result the authors established.
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.