d4-conf-aaai-2008-0259

The strongest mirror is a Bayesian cooperative economy with many agents in a few complete types. A type records everything relevant to an agent: their risk preferences, information partition, and production characteristics. A society is a mass vector \(\mu\in\mathbb{Q}_{\ge0}^{\mathcal A}\) with \(\sum_a\mu_a=1\). The possible worlds and their common prior remain finite, as in the paper; it is the population that becomes continuous.

A plausible setting is a large production cooperative whose members fall into a few dozen skill and information categories. Hundreds of thousands of people may share those categories, and a coalition’s worth may depend on how much of each category joins and on which market or technology state occurs. Let \(V_\omega(x)\) be the worth of a coalition with mass composition \(x\in[0,\mu]\) in world \(\omega\). For a concrete computational input, let each \(V_\omega\) be the value of a rational production LP with type-specific capacity limits \(x\). A grand contract assigns each member of type \(a\) a per-capita payoff \(q_a(\omega)\). It is feasible when \(\sum_a\mu_a q_a(\omega)\le V_\omega(\mu)\) in every world. A deviating coalition of composition \(x\) may choose per-capita payoffs \(r_a(\omega)\), feasible when \(\sum_a x_a r_a(\omega)\le V_\omega(x)\) in every world. The decision is whether a given feasible grand contract is in the relevant core; a witness of failure is a composition and a feasible contract that blocks it.

This is a population continuization, with the natural co-modification that coalition supplies and payoffs scale with mass. It is not a continuization of the paper’s uncertainty or outcome space. In the \(n\)-agent version, type counts \(n_a\) give masses \(\mu_a=n_a/n\), and allowed coalition compositions lie on the grid \(x_a=k_a/n\). With continuous \(V_\omega\), these grids become dense as \(n\) grows. This gives a concrete high-multiplicity bridge, while leaving open how exact core membership behaves at zero-slack boundaries.

The lead anchor is Theorem 2. The paper states it as its own result in Section 5; its proof is omitted, and it relies on Lemma 2. In full, for a risk-neutral BCG and a grand contract \(c^N\), that contract is in the ex-interim core if and only if, for every coalition \(S\subseteq N\) and every information set \(I\in\mathcal I^\vee_S\),
\[ \mathbb E[\omega(S)\mid I]\le \sum_{j\in S}\mathbb E[c^N_j\mid I]. \]
Here \(\mathcal I^\vee_S\) is the partition formed by the nonempty intersections of one information set from each member’s partition.

Its continuous counterpart, Continuous Ex-Interim Core Membership, takes the finite worlds and rational prior, type masses \(\mu\), each type’s partition \(\Pi_a\), the production-LP descriptions of \(V_\omega\), and a feasible grand contract \(q\). It asks whether \(q\) is unblocked by every coalition composition \(x\in[0,\mu]\). For \(A(x)=\{a:x_a>0\}\), let \(\Pi^\vee_{A(x)}\) be the nonempty intersections of information sets from the partitions of the participating types. The exact question is whether
\[ \mathbb E[V_\omega(x)\mid I]\le \sum_{a\in A(x)}x_a\,\mathbb E[q_a(\omega)\mid I] \]
for every \(x\) and every positive-prior cell \(I\in\Pi^\vee_{A(x)}\). A solution is “in the core” or “blocked,” with a violating \(x,I\) as a blocking witness.

This is the best mirror because information is central to the paper’s ex-interim notion, and a type can naturally include an information partition. The continuous question preserves that feature instead of reducing the problem to uncertain coalition worth alone. With production-LP worth functions, my first algorithmic expectation is tractability for fixed \(\tau=|\mathcal A|\), by enumerating type supports and solving an LP separation problem for each support and information cell. For unrestricted \(\tau\), I would expect the support and information-pattern combinatorics to retain hardness; whether that hardness embeds cleanly from a discrete version is a further question, not a result of this paper.

Two other anchors support the same mirror on their own terms. Theorem 1, also stated by the paper as its result (with proof omitted; the paper notes that a similar reduction appeared earlier in Suijs and Borm), says that for risk-neutral agents \(c^N\) is in the ex-ante core exactly when, for every \(S\subseteq N\),
\[ \mathbb E[\omega(S)]\le\sum_{j\in S}\mathbb E[c^N_j]. \]
The corresponding Continuous Ex-Ante Core Membership problem asks whether, for every \(x\in[0,\mu]\),
\[ \mathbb E[V_\omega(x)]\le\sum_a x_a\mathbb E[q_a(\omega)]. \]
Under the stated production-LP representation, the violation search is an LP over coalition masses, so I expect this version to be tractable.

Theorem 3, stated by the paper with a straightforward proof omitted, says that \(c^N\) is in the risk-neutral ex-post core exactly when, for every coalition \(S\) and every world \(\omega\),
\[ \omega(S)\le\sum_{j\in S}c^N_j(\omega). \]
The corresponding Continuous Ex-Post Core Membership problem asks whether
\[ V_\omega(x)\le\sum_a x_aq_a(\omega) \]
for every \(x\in[0,\mu]\) and every world. With the same production-LP representation, I also expect this membership test to be tractable. It is a useful boundary case: stability must hold in each world, so the prior does not enter the test.

These anchors are computational characterizations, not formal P or hardness theorems. The paper itself warns that its linear characterizations do not by themselves make the finite-agent problems easy, because the coalition constraints are exponential in the number of agents. The continuous questions ask whether replacing agent subsets with type-mass compositions makes those constraints manageable under a succinct worth representation. Natural follow-ups are whether the corresponding *core nonemptiness* problems have efficient separation algorithms; whether the ex-ante, interim, and ex-post inclusion relation in Corollary 1 carries over; and where discrete hardness survives when the number of types grows.

The weakest point is the added structure needed to make this mirror computationally definite. The paper permits arbitrary coalition-value functions on a finite agent set; it does not posit repeated interchangeable members, masses, or a production-LP encoding of \(V_\omega\). The authors would likely recognize the resulting question as a continuous-population version of Bayesian core stability, but whether they accept this particular large-cooperative scenario depends on whether its type categories and aggregate production values count as a faithful model of their coalitions. Their existing uncertainty over worlds is not itself a collision: the proposed mirror changes the population, not the source or distribution of uncertainty.