Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation

DOI10.1016/j.cor.2017.01.019zbMath1394.91024OpenAlexW2583836055WikidataQ56476142 ScholiaQ56476142MaRDI QIDQ1652281

Daniel Gómez, Javier Castro, Juan Tejada, Elisenda Molina

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.01.019

zbMATH Keywords

game theoryShapley valuecomputer scienceoperations researchstratified sampling algorithm

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items (14)

Assessing systematic sampling in estimating the Banzhaf-Owen value ⋮ A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ Efficient computation of the Shapley value for large-scale linear production games ⋮ On the Shapley value of liability games ⋮ On systems of quotas from bankruptcy perspective: the sampling estimation of the random arrival rule ⋮ Variance reduced Shapley value estimation for trustworthy data valuation ⋮ On stratified sampling for estimating coalitional values ⋮ Hodge decomposition and the Shapley value of a cooperative game ⋮ Sampling methods to estimate the Banzhaf-Owen value ⋮ Unnamed Item ⋮ A stochastic approach to approximate values in cooperative games ⋮ Voting power on a graph connected political space with an application to decision-making in the council of the European Union ⋮ Monte Carlo methods for the Shapley-Shubik power index ⋮ Coalitional games for networked controllers with constraints on semivalues: a randomized design approach

Uses Software

• SDaA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
• Control and voting power in corporate networks: Concepts and computational aspects
• Polynomial calculation of the Shapley value based on sampling
• The Shapley value for cooperative games under precedence constraints
• Generating functions for computing the Myerson value
• The Shapley and Banzhaf values in microarray games
• Statistical analysis of the Shapley value for microarray games
• Complexity of constructing solutions in the core based on synergies among coalitions
• A polynomial rule for the problem of sharing delay costs in PERT networks
• Computational Aspects of Cooperative Game Theory
• On the Complexity of Cooperative Solution Concepts
• Probability Inequalities for Sums of Bounded Random Variables
• Cost Allocation for a Tree Network with Heterogeneous Customers
• Generating functions for computing power indices efficiently

This page was built for publication: Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation