| paper | d4-journals-mss-2017-0034 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Neither named result asserts an algorithm, computational hardness, or another computational result under the stated test. Theorem 1's limit from finite games provides no computation method, rate, or finite-input complexity bound; Theorem 2 is an existence claim about a different solution concept. A finite-type computation problem would be a new direction, not a continuous mirror of a computational result in this paper.
fails bit a — no named computational result to mirror
Theorem 1 and Theorem 2 are existence results without computational guarantees; the paper supplies no computational result for a mirror to cover.
I can’t make a sound positive case under the required anchor rule: this paper has no named computational-complexity result to mirror.
The closest result is Theorem 1, proved here. Under (R1)—measurability of \(t\mapsto U(t,f)\) and an integrable bound—and (R2)—concavity in the strategy profile and equi-upper-semicontinuity across players—it proves that the weak-core is nonempty. It also proves that a weak-core element is a limit of elements in weak-cores of appropriate finite games. That is an existence and approximation theorem, not an efficient algorithm or a complexity classification; its limit argument gives no running time in support size or input bit length.
Theorem 2 is another nearby result: citing Khan and Sun, the paper states that a pure-strategy Nash equilibrium exists when the payoffs are continuous in action and distribution, the payoff map is measurable in player type, the action space is countable, and the player measure is nonatomic. This too is an equilibrium-existence result, not a computational one, and it concerns Nash equilibrium rather than the weak-core.
The positive case is that the paper’s continuum-player model gives analytic precedent for treating a society as mass over player types. But the paper already studies a continuum population, so that alone is not a new population mirror. A finite-type, rational-input problem asking to compute or test the weak-core could be a worthwhile follow-up; it would be a new computational question, not a continuous continuation of a numbered computational result in this paper.
There is no computational result here to continuize, and the population is already a continuum. Theorem 1 proves weak-core existence under regularity assumptions; its additional limit statement does not give an algorithm, a running time, or a finite input representation. Its “finite games” are not a high-multiplicity encoding: each player of \(G_\pi\) is a measurable coalition \(K_j\), with strategy space \(B(K_j,A)\). The theorem gives no approximation rate or dependence on support size and bit length. So it cannot anchor the kind of computational mirror ChoCo studies.
Theorem 2 is a still weaker anchor: it restates an existence result for pure-strategy Nash equilibrium, attributed to Khan and Sun. Nash equilibrium is not the weak-core, and neither result asks how to compute an outcome. A computational question about equilibria would be a new algorithmic problem, not a mirror of a result established by this paper.
The best repair is to restrict the model to finitely many types with rational masses, finitely many actions, and rational payoffs depending on action and aggregate action distribution, then ask whether the weak-core is nonempty or how to find a member. That is a coherent population-mass model. But it is a fresh computational game-theory problem: the paper’s \(U(t,f)\) can depend on the entire measurable strategy profile, while its finite-game approximation still has function-valued strategies. Making the proposed input finite and succinct requires choosing a new payoff language and solving the coalition-blocking problem in that language. Theorem 1 does not supply that formulation or its algorithmic starting point. The analogous route through Theorem 2 changes the target from coalition stability to Nash equilibrium.
This is a strong reason to reject these as continuous mirrors of this paper, not proof that no useful project can grow from it. Finite-type anonymous core computation could be worthwhile on its own, and the finite-mass setting is sensible. The negative case is weakest there: if ChoCo expands to algorithmic game theory, that project may fit. But it would be a new computational direction on a model that is already continuous in its population, not the continuization of a computational 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.