Stratified Sampling for Shapley Value Estimation: A Variance-Optimal Approach

The computation of the Shapley value is a central problem in cooperative game theory, but its factorial complexity makes exact evaluation infeasible for large-scale games. In this work, we reinterpret the Shapley value as a stratified expectation over coalition sizes, revealing an inherent two-stage sampling structure. Based on this formulation, we introduce a class of stratified Monte Carlo estimators that decouple the target distribution from the sampling design. This enables the use of variance reduction techniques from survey sampling, including optimal allocation strategies such as Neyman allocation. We derive unbiased estimators under general sampling distributions and provide a variance analysis that characterizes the optimal sampling scheme. Experimental results show that the proposed approach significantly improves convergence in structured games where marginal contributions depend on coalition size, while maintaining comparable performance in unstructured settings. The proposed framework is simple, flexible, and naturally parallelizable, making it well suited for large-scale applications.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-01
DOI
https://doi.org/10.5281/zenodo.19953299
Primary Topic
Game Theory and Voting Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Stratified Sampling for Shapley Value Estimation: A Variance-Optimal Approach

Alberto Almech
Zenodo (CERN European Organization for Nuclear Research)
Game Theory and Voting Systems
article

Stratified Sampling for Shapley Value Estimation: A Variance-Optimal Approach

Alberto Almech
article en

Abstract

The computation of the Shapley value is a central problem in cooperative game theory, but its factorial complexity makes exact evaluation infeasible for large-scale games. In this work, we reinterpret the Shapley value as a stratified expectation over coalition sizes, revealing an inherent two-stage sampling structure. Based on this formulation, we introduce a class of stratified Monte Carlo estimators that decouple the target distribution from the sampling design. This enables the use of variance reduction techniques from survey sampling, including optimal allocation strategies such as Neyman allocation. We derive unbiased estimators under general sampling distributions and provide a variance analysis that characterizes the optimal sampling scheme. Experimental results show that the proposed approach significantly improves convergence in structured games where marginal contributions depend on coalition size, while maintaining comparable performance in unstructured settings. The proposed framework is simple, flexible, and naturally parallelizable, making it well suited for large-scale applications.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 3%
Game Theory and Voting Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.