---
title: Type-Based Least-Core Payoff Allocation
url: https://www.emergentmind.com/topics/type-based-least-core-payoff-allocation-scheme
type: topic
---

# Type-Based Least-Core Payoff Allocation

A type-based least-core payoff allocation scheme is a cooperative game-theoretic construct specifically adapted to heterogeneously-typed agent systems with coalitional size constraints, as exemplified by mixed-energy truck platooning scenarios. This scheme assigns payoffs based exclusively on agent types, ensuring all members of a given type receive an identical benefit. It leverages least-core concepts to achieve stable, approximately core-like allocations even when strict core allocations are infeasible due to coalition structure restrictions. The method is computationally efficient and ensures strong stability against coalitional deviations under bounded coalition sizes [2512.06283].

## 1. Mathematical Framework and Game Definition

The underlying coalitional game is defined on a set $N = \{1,2,...,N\}$, partitioned into electric truck set $N_e$ and fuel truck set $N_f$, so that $N = N_e \cup N_f$ and $|N| = N_e + N_f$. Each agent $i \in N$ is assigned a type $T_i \in \{e, f\}$, denoting either electric or fuel-propulsion. Feasible coalitions are required to satisfy a platoon-size constraint: $2 \leq |S| \leq M$, where $M$ is the maximum coalition size ($2 \leq M < N$).

The characteristic value function is prescribed as:
\[
v(S) = \max_{L \in S} v(S, L) =
\begin{cases}
0, & S = \emptyset, \\
\epsilon_e (S_e - 1) + \epsilon_f S_f, & 1 \leq |S| \leq M,\, S_e \geq 1, \\
\epsilon_f (S_f - 1), & 1 \leq |S| \leq M,\, S_e = 0,
\end{cases}
\]
where $S_e = |S \cap N_e|$, $S_f = |S \cap N_f|$, and $\epsilon_e, \epsilon_f > 0$ are type-specific per-unit-time savings for electric and fuel followers, respectively, with $\epsilon_e \leq \epsilon_f$. Leaders receive zero, while the formulae reflect the total platooning benefit available to each coalition under the imposed size cap [2512.06283, Eq. (2)].

## 2. Type-Based Allocation Principle

In contrast to individualistic payoff schemes, type-based allocation restricts the form of the allocated payoff vector $x$:
\[
x_i =
\begin{cases}
x_e, & T_i = e, \\
x_f, & T_i = f,
\end{cases}
\]
for scalars $x_e, x_f \geq 0$ [2512.06283, Eq. (13)]. This uniformity reflects the symmetry of cost savings postulated for each powertrain type and greatly reduces the dimensionality of the allocation space, enabling tractable computation of stability-preserving payoffs in large-scale fleet settings.

## 3. Coalition-Structure Core and Stability Constraints

The coalition-structure core (CS-core) is adapted to games with imposed coalition partitions $P^* = \{S_1, ..., S_K\}$, typically reflecting the optimal set of size-constrained platoons. A payoff vector $x$ lies in $\mathrm{CS\text{-}core}(P^*)$ if and only if:
- **Efficiency on each coalition:** For all $S_m \in P^*$, $\sum_{i\in S_m} x_i = v(S_m)$,
- **No profitable deviation:** For any $S \subseteq N$ with $2 \leq |S| \leq M$, $\sum_{i \in S} x_i \geq v(S)$ [2512.06283, Definition 5].

Non-emptiness of the CS-core depends on the feasibility of these constraints. When infeasible (e.g., due to coalition overlaps or partition size mismatches), a least-core formulation becomes necessary.

## 4. Least-Core Relaxation and Linear Programming Formulation

The least-core relaxes blocking constraints via a uniform slack $\epsilon \geq 0$ and seeks the minimum $\epsilon^*$ rendering an allocation feasible. An allocation is $\epsilon$-feasible if:
- It satisfies partition efficiency: $\sum_{i\in S_m} x_i = v(S_m)$ for all $S_m \in P^*$,
- For all $C \subseteq N$ with $2 \leq |C| \leq M$, $\sum_{i \in C} x_i \geq v(C) - \epsilon$ [2512.06283, Definition 6].

Within the type-based restriction, the optimal $(x_e^*, x_f^*, \epsilon^*)$ solve:
\[
\begin{aligned}
\min_{x_e, x_f,\, \epsilon \geq 0} \quad & \epsilon \\
\text{s.t.}\quad &
x_e N_e + x_f N_f =
\epsilon_e (N_e - L_e^*) + \epsilon_f (N_f - L_f^*), \\
& x_e C_e + x_f C_f \geq v(C) - \epsilon \quad \forall C_e + C_f \leq M, \\
& x_e, x_f \geq 0,
\end{aligned}
\]
where $L_e^*$, $L_f^*$ are the number of electric and fuel platoon leaders in $P^*$ [2512.06283, Eq. (14)]. Due to type symmetry, blocks of constraints collapse to $O(M^2)$, ensuring manageable computational overhead.

## 5. Algorithmic Realization and Computational Complexity

The procedure first enumerates all possible type compositions $(C_e, C_f)$ of feasible coalitions up to size $M$. For each composition, it encodes the blocking constraint in the LP. The full system thus involves:
- $O(M^2)$ constraint inequalities
- 3 real variables $(x_e, x_f, \epsilon)$.

The LP can be solved using standard optimization packages. For practical values ($M \leq 100$), run-time is negligible [2512.06283, Algorithm, Section IV]. This efficiency is a direct consequence of the type-based reduction in variable count.

## 6. Stability Characterization and Least-Core Radius

If the optimal $\epsilon^* = 0$, the scheme achieves a CS-core allocation—i.e., exact coalition-wise stability. Otherwise, $\epsilon^*$ quantifies the minimal total deficit tolerated in blocking constraints, often interpreted as the smallest uniform subsidy necessary to stabilize the allocation within the restricted family [2512.06283, Propositions 1(a,b), Remark 2]. The type-based least-core allocation always minimizes the worst-case violation possible through type-symmetric payoffs.

## 7. Empirical Evaluation and Comparative Performance

A numerical case with $N = 9$ ($N_e = 3$, $N_f = 6$), $M = 4$, $\epsilon_e = 0.048$, $\epsilon_f = 0.07$ produces optimal $(x_e^*, x_f^*, \epsilon^*) \approx (0.032, 0.054, 0.016)$, leading to a stability index of $I = 1 - \epsilon^*/V(P^*) \approx 96.2\%$ [2512.06283, Section V A].

Comparison against equal-split, follower-only, type-proportional, and leader-subsidy baselines demonstrates a superior stability index (generally $>$92\%) and higher overall fleet benefit under the type-based least-core scheme across all tested platoon sizes ($M=3,...,9$) [2512.06283, Section V B, Figures 3–4].

| Allocation Scheme        | Stability Index $I$ (typical) | Notes                      |
|-------------------------|-------------------------------|----------------------------|
| Type-based least-core    | $>$92%                        | Highest stability, efficient |
| Equal-split             | Lower                         | Less fair for heterogeneity |
| Follower-only           | Lower                         | Ignores leader compensation |
| Type-proportional       | Lower                         | Proportional, lacks stability |
| Leader-subsidy          | Lower                         | Incomplete stability        |

A plausible implication is that this approach is well suited to large-scale, mixed-fleet logistical optimization and benefit-sharing tasks where computational scalability and stability are critical. The method provides a closed-form, highly efficient framework for fair and robust benefit distribution in practical transportation networks [2512.06283].

Source: https://www.emergentmind.com/topics/type-based-least-core-payoff-allocation-scheme