Multi-Group Ex-Ante Agent Game (MEAG)

• Multi-Group Ex-Ante Agent Game (MEAG) is a complete-information normal-form game derived from multi-group Bayesian games by converting type-contingent mappings into distinct agents.
• It transforms equilibrium search by mapping group strategies into a finite action set while preserving both MBNE and strongly MBNE through a bijection.
• The framework enables potential-game analysis using semi-tensor product algebra, offering a tractable route for equilibrium computation and strategic evaluation.

Searching arXiv for the primary paper and closely related ex-ante/group-game work. The Multi-Group Ex-Ante Agent Game (MEAG) is a complete-information normal-form game constructed from a multi-group Bayesian game (MBG) by replacing each group-type pair with a distinct agent. In the formulation of "Multi-group Bayesian Games" (Yuan et al., 2 Oct 2025), the construction is the central device for converting equilibrium search from a space of type-contingent mappings into an ordinary finite action space. The resulting normal-form representation preserves equilibrium meaning through a bijection $\Gamma$, supports both multi-group Bayesian Nash equilibrium (MBNE) and strongly MBNE, and provides a tractable entry point for potential-game analysis, semi-tensor-product algebra, and equilibrium computation.

1. Origin in multi-group Bayesian games

MEAG is defined only relative to an underlying MBG. In that model, the original player set is partitioned into groups,

$$G=\mathop{\cup}\limits_{l=1}^{r} G_l,\qquad G_i \bigcap G_j=\emptyset,\ \forall i\neq j,\ i,j\in \mathcal{D}_{r},$$

where $G_l$ is the $l$-th group and $|G_l|=m_l$. The type and action spaces are grouped accordingly: $$\mathcal{T}_{G_l}={\prod}_{j \in G_l} \mathcal{T}_j,\qquad \mathcal{A}_{G_l}={\prod}_{j \in G_l} \mathcal{A}_j,$$ so that

$$\mathcal{T}={\prod}_{l=1}^r \mathcal{T}_{G_l},\qquad \mathcal{A}={\prod}_{l=1}^r \mathcal{A}_{G_l}.$$

The key informational assumption is that private information is shared within groups and incomplete across groups. Thus players in group $l$ observe the whole group type vector $T_l\in\mathcal{T}_{G_l}$, but do not observe $T_{-l}$. Beliefs are therefore defined at the group level: $$G=\mathop{\cup}\limits_{l=1}^{r} G_l,\qquad G_i \bigcap G_j=\emptyset,\ \forall i\neq j,\ i,j\in \mathcal{D}_{r},$$0

Formally, the MBG is the tuple

$$G=\mathop{\cup}\limits_{l=1}^{r} G_l,\qquad G_i \bigcap G_j=\emptyset,\ \forall i\neq j,\ i,j\in \mathcal{D}_{r},$$1

where $$G=\mathop{\cup}\limits_{l=1}^{r} G_l,\qquad G_i \bigcap G_j=\emptyset,\ \forall i\neq j,\ i,j\in \mathcal{D}_{r},$$2 is a common-knowledge probability distribution and $$G=\mathop{\cup}\limits_{l=1}^{r} G_l,\qquad G_i \bigcap G_j=\emptyset,\ \forall i\neq j,\ i,j\in \mathcal{D}_{r},$$3 is the payoff-function set. A strategy is group-contingent: $$G=\mathop{\cup}\limits_{l=1}^{r} G_l,\qquad G_i \bigcap G_j=\emptyset,\ \forall i\neq j,\ i,j\in \mathcal{D}_{r},$$4 Hence an MBG equilibrium is sought over a profile of mappings rather than over a simple finite action set. That mapping-space difficulty is the immediate motivation for the MEAG transformation (Yuan et al., 2 Oct 2025).

2. Construction of the MEAG

The MEAG compiles every possible group type into a separate normal-form decision maker. Its agent set is

$$G=\mathop{\cup}\limits_{l=1}^{r} G_l,\qquad G_i \bigcap G_j=\emptyset,\ \forall i\neq j,\ i,j\in \mathcal{D}_{r},$$5

where agent $$G=\mathop{\cup}\limits_{l=1}^{r} G_l,\qquad G_i \bigcap G_j=\emptyset,\ \forall i\neq j,\ i,j\in \mathcal{D}_{r},$$6 represents the event that group $$G=\mathop{\cup}\limits_{l=1}^{r} G_l,\qquad G_i \bigcap G_j=\emptyset,\ \forall i\neq j,\ i,j\in \mathcal{D}_{r},$$7 has realized type $$G=\mathop{\cup}\limits_{l=1}^{r} G_l,\qquad G_i \bigcap G_j=\emptyset,\ \forall i\neq j,\ i,j\in \mathcal{D}_{r},$$8. The corresponding action set is inherited from the original group: $$G=\mathop{\cup}\limits_{l=1}^{r} G_l,\qquad G_i \bigcap G_j=\emptyset,\ \forall i\neq j,\ i,j\in \mathcal{D}_{r},$$9

The transformed payoffs are ex-ante expected payoffs under the prior. For player $G_l$0, the payoff attached to agent $G_l$1 is

$G_l$2

For the cooperative interpretation inside group $G_l$3, these are averaged: $G_l$4 mirroring the MBG group payoff

$G_l$5

The transformation is organized by a bijection

$G_l$6

defined by

$G_l$7

Conversely, for any $G_l$8,

$G_l$9

Conceptually, the MEAG turns each value of a strategy function $l$0 into an ordinary action coordinate. This suggests a useful way to read the construction: the Bayesian dependence on type is not removed, but rather compiled into a normal-form player set indexed by type realizations. The paper explicitly positions MEAG as the group-structured analogue of the ex-ante agent transformation for standard Bayesian games (Yuan et al., 2 Oct 2025).

3. Equilibrium notions and the correspondence theorem

The MBG distinguishes two within-group behavioral regimes. The first is MBNE, corresponding to within-group cooperative play. Group $l$1 chooses, for each realized type $l$2, an action maximizing expected average group payoff: $l$3

The second is strongly MBNE, corresponding to within-group noncooperative play with complete information. The chosen group action must simultaneously maximize every member’s expected payoff: $l$4

The MEAG mirrors this distinction. A Nash equilibrium of the MEAG is defined using $l$5: $l$6 for every $l$7. A strongly Nash equilibrium is defined agentwise through $l$8: $l$9

The central correspondence theorem states that

$|G_l|=m_l$0

The proof rewrites the MEAG best-response condition through $|G_l|=m_l$1, then uses

$|G_l|=m_l$2

with $|G_l|=m_l$3 constant with respect to the deviating action. The resulting optimization criterion is exactly the MBNE or strongly MBNE condition (Yuan et al., 2 Oct 2025).

A frequent source of confusion is the paper’s use of the term strongly Nash equilibrium. Here it does not denote the standard coalition-proof strong Nash concept. It denotes the equilibrium notion induced by requiring, for each group-type agent, simultaneous individual optimality for all members of the corresponding original group. The terminology is internal to the MBG-MEAG correspondence.

4. Potential structure and semi-tensor-product representation

MEAG is not merely an equilibrium-preserving reformulation; it is also the vehicle through which the paper develops a potential-game characterization. In the MBG, a potential function $|G_l|=m_l$4 satisfies, for the cooperative notion,

$|G_l|=m_l$5

and, for the strong notion,

$|G_l|=m_l$6

If the MBG is potential or strongly potential, then its MEAG is potential or strongly potential, with induced potential

$|G_l|=m_l$7

This induced potential converts equilibrium search into potential maximization.

To operationalize the construction, the paper uses the semi-tensor product (STP). The prior is encoded by \