| paper | d4-journals-scw-2001-0039 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | medium |
| authors would recognise it | yes |
The theorems’ proofs give explicit finite constructions, so I count them as computationally character-like despite the lack of running-time claims. But the proponent offers only a general suggestion of a type-mass core problem, not a concrete continuous question for either anchor. Turning named-player partitions and deviations into aggregate coalition allocations would require a new model, so no mirror survives as stated.
fails bit b-changes — the continuum limit changes the question
No result is mirrored as stated; Theorems 1 and 2 are the closest anchors. The finite counterexamples and economic applications are not covered.
There is no named computational result to anchor a compliant continuous mirror in this paper. Theorem 1, proved here, says that a finite coalition formation game satisfying the weak top-coalition property has a nonempty core. Theorem 2, also proved here, says that a game satisfying the top-coalition property with strict preferences has a unique core partition. Neither states a complexity result, specifies an algorithm’s running time, or analyzes a computational problem.
The paper’s empty-core examples in Games 1–3 are finite counterexamples, not hardness results. The top-trading-cycles algorithm discussed in the housing-market section is not a numbered computational result of this paper, and the paper gives no complexity analysis for it. The cited Kaneko–Wooders result on a continuum of players with finite types is relevant background for population continuity, but it concerns core existence, not the computational questions ChoCo targets.
One could propose a high-multiplicity core problem with types as complete preference descriptions and masses as population fractions. But the paper’s theorems do not establish that such a problem is tractable, nor do its examples establish that hardness dissolves in a continuum. Treating either theorem as an algorithmic anchor would overstate what the paper proves. The strongest honest positive case is therefore limited: this is a plausible subject for a continuous-population follow-up, but the paper supplies no qualifying computational anchor for the requested mirror.
The strongest negative case is the one the proponent already identifies: this paper supplies no computational result to mirror. Theorem 1 proves core existence under the weak top-coalition property; Theorem 2 proves uniqueness under the top-coalition property and strict preferences. Neither analyzes a computational problem, gives a running time, or makes an algorithmic claim. Games 1–3 are finite counterexamples, not hardness results. The housing-market section describes top trading cycles, but does not analyze its complexity. There are therefore no qualifying computational anchors here.
The best computational follow-up to Theorem 1 would be to ask whether one can find a core partition for a society represented by masses of preference types. But the paper’s theorem assumes that every subset of named players has a weak top-coalition. A mass-based version would need to define which type-level coalitions can form, how to represent the resulting partition, and what it means for a positive mass to block. Those are plausible modeling choices, but the resulting algorithmic question would be newly formulated; it would not be a complexity mirror of Theorem 1.
The same holds for Theorem 2. One could ask how to compute the unique core partition from a compressed description of a high-multiplicity society. Yet the paper establishes uniqueness, not a computational method. In a continuum, uniqueness of a partition of named individuals is also not the natural target; one would likely need uniqueness of an aggregate allocation across types. That could be a sensible new question, but it requires its own model and result.
The paper’s mention of Kaneko and Wooders supports the plausibility of continuum-player coalition models, but their cited result concerns core existence, not computational complexity. It is neither a collision nor a reason to reject high multiplicity. It does, however, underline that the paper’s contribution is about existence conditions for finite games, rather than an unfinished computational analysis.
So the negative case is strong as a case against treating this paper as a source of computational mirrors: its central results do not provide the required anchors, and turning them into algorithmic problems takes additional modeling work. The broader claim that no scenario could yield a worthwhile continuous-population computation is weaker. Computing or testing core properties in a compressed society could be worthwhile research; the paper alone gives little basis for calling it a mirror of the results presented here.
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.