| paper | d4-journals-geb-2007-0037 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper’s named results establish analytic properties of cooperative games, including balancedness, core uniqueness, and asymptotic core shrinkage. None asserts an algorithm, a complexity bound, hardness, or a computational formulation used to compute, so there is no computational result to mirror.
fails bit a — no named computational result to mirror
No result is covered by a computational mirror; the balancedness, singleton-core, Gaussian diameter, and Markowitz results remain analytic.
I can’t make a compliant positive case from this paper: it has no numbered theorem, lemma, corollary, or proposition asserting a computational complexity result or algorithmic classification.
The closest named results are analytic. Theorem 2.3, proved here, establishes total balancedness and gives an explicit core charge under its stated conditions. Theorem 3.2, also proved here, says the core is a singleton for a nonatomic newsvendor game when the demand measure has a Bochner density and aggregate demand has a continuous distribution. Proposition 5.1 studies when the core’s diameter shrinks in a Gaussian family. None classifies the complexity of a computational problem, so I can’t present any of them as a tractability or hardness anchor.
A plausible future computational question would use a large retail network with many outlets but relatively few complete types, each specifying its demand exposure and relevant costs. Mass would represent the fraction of outlets of each type; the decision could be a per-capita profit allocation that sums to the pooled optimum and gives every coalition at least its own optimal expected profit. That regime is credible, and the paper’s nonatomic newsvendor model supports it. But the computational question is not a result of this paper, and mirroring Theorem 3.2’s continuum-player model would largely restate a model the authors already study.
The strongest case against a ChoCo mirror is that the paper supplies no computational result to mirror. Theorem 2.3 and Theorem 3.2 characterize cores; Proposition 5.1 describes an asymptotic change in core diameter. None defines an algorithmic problem with an input encoding, complexity bound, or hardness result. Turning one of them into a complexity question would mean adding a computational objective to the paper, not continuizing one of its computational results.
The proponent’s outlet example is a credible high-multiplicity regime. Its most natural task—finding a stable profit allocation—also has a weak computational hook here. For finitely many types with a tractable representation of joint demand, Theorem 2.3 gives a core allocation from the aggregate-demand quantile and type-level expectations. Computing that allocation is then largely evaluating the paper’s formula. With richer demand laws, the difficulty depends on how those laws are encoded; that is not a complexity question the paper specifies.
Theorem 3.2 makes the same task still less promising as a mirror: under its assumptions, the core is a singleton, and the paper gives its density explicitly. A question about approximating that density for a chosen class of distributions could be worthwhile, but its difficulty would come from the chosen representation and approximation goal, not from a computational problem posed by the theorem.
Proposition 5.1 studies core-diameter shrinkage in an exchangeable Gaussian family. Asking whether shrinkage occurs, or computing the diameter in that family, follows the analytic result and its formula. A computational study for general covariance structures or a different allocation criterion could be harder, but it would add a new objective or model rather than extract a computational question from Proposition 5.1.
So the negative case is strong for the narrower claim that this paper offers no ready-made ChoCo computational mirror. It is weaker against the user’s universal claim: the paper itself treats nonatomic populations, and the outlet scenario is sensible. I would not argue that no algorithmic follow-up could be worthwhile. Questions about richer encoded demand models or computing properties of the full core may be legitimate research—but they would be new computational cooperative-game or stochastic-optimization projects, not mirrors of the results this paper proves.
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.