Papers
Topics
Authors
Recent
Search
2000 character limit reached

Coalition Path View: Group Attribution

Updated 12 June 2026
  • Coalition Path View is a framework that quantifies collective group impact in cooperative games by evaluating the marginal effect of group removal via the Union Shapley value.
  • It extends the classical Shapley value to groups, ensuring axiomatic fairness and balanced contributions while capturing both group worth and synergy.
  • The approach employs sampling-based computational strategies and has significant implications for model explanation, sensitivity analysis, and fairness allocation.

The Coalition Path View describes a principled approach to quantifying the collective impact of a group—referred to as a coalition—in cooperative games, model explanation, and sensitivity analysis, with a focus on extensions of the Shapley value for groups. It provides a unifying perspective on group attributions, emphasizing the marginal effect of a group's collective presence or removal on the global value or outcome of interest. Central to this view is the Union Shapley value, a canonical group extension of the classical Shapley value justified via coherent axiomatic characterizations. The Coalition Path View clarifies the interplay between group value, group synergy, and the broader landscape of group semivalues and their computational properties, with direct implications for explainable AI, sensitivity analysis, and fairness allocation (Kępczyński et al., 27 May 2025).

1. Foundations: Coalitional Games, Harsanyi Dividends, and Potential

A coalitional game is given by a tuple (N,v)(N, v), where NN is a finite player set and v ⁣:2NRv\colon 2^N \to \mathbb{R} is a set function satisfying v()=0v(\emptyset)=0. The Harsanyi dividend Δv(T)\Delta_v(T) for TNT\subseteq N is defined by the Möbius inversion

Δv(T)=ST(1)TSv(S),v(S)=TSΔv(T).\Delta_v(T) = \sum_{S\subseteq T}(-1)^{|T|-|S|} v(S),\qquad v(S)=\sum_{T\subseteq S} \Delta_v(T).

The global “potential” of a game aggregates all coalitional effects: P(N,v)=TN,TΔv(T)T.P(N, v) = \sum_{T\subseteq N,\, T\neq \emptyset} \frac{\Delta_v(T)}{|T|}. These structures support the definition of group-centric value functions and enable algebraic manipulations foundational to the Coalition Path View (Kępczyński et al., 27 May 2025).

2. Union Shapley Value: Mathematical Definition and Structural Insights

The Union Shapley value USS(N,v)US_S(N, v) quantifies the marginal effect of the coalition SNS\subseteq N by evaluating the drop in potential when NN0 is removed: NN1 Alternatively, the path-based marginal contribution formula is

NN2

This expression cleanly generalizes the classical Shapley value (recovered for NN3) and formalizes the coalition path as the process of sequentially removing NN4 and observing the overall decrement in potential. The Union Shapley value operates as a “collective removal” metric, allocating to NN5 the credit for every coalition NN6 for which NN7, partitioning dividends appropriately (Kępczyński et al., 27 May 2025).

3. Axiomatic Characterization and Semivalue Relationships

Two parallel axiomatic characterizations uniquely identify the Union Shapley value:

  • Potential + Shapley consistency: There exists NN8 such that NN9 and for v ⁣:2NRv\colon 2^N \to \mathbb{R}0, v ⁣:2NRv\colon 2^N \to \mathbb{R}1 coincides with the Shapley value.
  • Balanced contributions + Shapley consistency: For all v ⁣:2NRv\colon 2^N \to \mathbb{R}2,

v ⁣:2NRv\colon 2^N \to \mathbb{R}3

with v ⁣:2NRv\colon 2^N \to \mathbb{R}4. Both axiomatizations replace the classical efficiency axiom with group-level or singleton-level modifications and retain group symmetry (linearity) and a null-player principle adapted to groups (Kępczyński et al., 27 May 2025).

The Union Shapley value nests within the broader class of group semivalues: v ⁣:2NRv\colon 2^N \to \mathbb{R}5 where the Union Shapley choice is v ⁣:2NRv\colon 2^N \to \mathbb{R}6, but alternatives (e.g., Merge Shapley, sum of singleton Shapleys) use different v ⁣:2NRv\colon 2^N \to \mathbb{R}7-families. The dual semivalue, induced by Möbius duality, is the Intersection Shapley value, which quantifies synergy: v ⁣:2NRv\colon 2^N \to \mathbb{R}8 Key inclusion-exclusion relations intertwine Union and Intersection Shapley values, reflecting a deep combinatorial symmetry (Kępczyński et al., 27 May 2025).

4. Computational Tractability and Algorithmic Aspects

All group semivalues and their duals require summation over v ⁣:2NRv\colon 2^N \to \mathbb{R}9 coalitions. No polynomial-time algorithm exists for general v()=0v(\emptyset)=00, but Monte Carlo and random sampling strategies (as in classical Shapley approximation) are effective in practice. For Union Shapley, it suffices to sample coalitions v()=0v(\emptyset)=01 with v()=0v(\emptyset)=02 and aggregate v()=0v(\emptyset)=03. For Intersection Shapley, sample v()=0v(\emptyset)=04. The paper proposes future work in polynomial-time approximations but provides no such specialized algorithms (Kępczyński et al., 27 May 2025).

5. Interpretive Examples: Distinguishing Group Impact and Synergy

The “12 ∣ 34” game, with v()=0v(\emptyset)=05 and v()=0v(\emptyset)=06 equals v()=0v(\emptyset)=07 if v()=0v(\emptyset)=08 contains either v()=0v(\emptyset)=09 or Δv(T)\Delta_v(T)0, vividly illustrates the discriminative power of the Union Shapley value. Merge Shapley and the sum-of-singletons both assign value Δv(T)\Delta_v(T)1 to Δv(T)\Delta_v(T)2 and Δv(T)\Delta_v(T)3, yet their removal has qualitatively different effects:

  • Δv(T)\Delta_v(T)4 (removal still leaves a winning coalition);
  • Δv(T)\Delta_v(T)5 (removal destroys all positive coalitions). The Intersection Shapley value dually quantifies synergy:
  • Δv(T)\Delta_v(T)6,
  • Δv(T)\Delta_v(T)7. These metrics allow clear separation of group “worth” (collective impact) and group “synergy” (non-additive cooperative effects), equipping the Coalition Path View with operational expressiveness not available to singleton-based indices (Kępczyński et al., 27 May 2025).

6. Theoretical and Practical Significance

The Coalition Path View, instantiated by the Union Shapley value, provides a conceptually rigorous, axiomatically unique, and algebraically tractable paradigm for quantifying group-level contributions in coalitional scenarios. It clarifies the allocation of shared value, disentangles group effects from mere summation of individuals, and connects classical results on interaction indices and semivalue theory. The explicit duality between removal (Union) and synergy (Intersection) values further anchors the theory within the broader landscape of cooperative game theory, sensitivity analysis, and modern explainable AI paradigms. The challenge of exponential computational scaling is mitigated partially by sampling and approximation strategies, with algorithmic efficiency remaining a prominent research direction (Kępczyński et al., 27 May 2025).

7. Connections and Implications

The Coalition Path View sharply differentiates itself from naïve grouping (e.g., sum of individual Shapleys or pure conditional worth) by enforcing fair, balanced attributions via Möbius-weighted summation across the whole power set of coalitions. Its formal structure supports extensions to fairness, feature selection, significance testing, and synergistic group analysis in machine learning and decision science. The path-based removal intuition, together with the axiomatic underpinnings, suggests applicability far beyond traditional cooperative games, aligning with recent trends in model interpretability and attribution for complex, structured data domains (Kępczyński et al., 27 May 2025).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Coalition Path View.