Polynomial calculation of the Shapley value based on sampling
type: Item
instance of: scholarly article
title: Polynomial calculation of the Shapley value based on sampling
zbMATH Open document ID: 1177.91021
author: Javier Castro
author: Daniel Gómez
author: Juan Tejada
published in: Computers \& Operations Research
publication date: 2008-12-17T00:00:00Z
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 5383156
zbMATH Keywords: game theory
zbMATH Keywords: Shapley value
zbMATH Keywords: sampling algorithm
describes a project that uses: SDaA
MaRDI profile type: Publication
full work available at URL: j.cor.2008.04.004
OpenAlex ID: W2073231946
Wikidata QID: Q57618684
cites work: Q5817870
cites work: On the Complexity of Cooperative Solution Concepts
cites work: Generating functions for computing the Myerson value
cites work: The Shapley value for cooperative games under precedence constraints
cites work: Generating functions for computing power indices efficiently
cites work: Cost Allocation for a Tree Network with Heterogeneous Customers
cites work: A polynomial rule for the problem of sharing delay costs in PERT networks
cites work: Multilinear Extensions of Games
cites work: Q5819795
cites work: Q4509479
cites work: Value Theory Without Efficiency
cites work: Q5545175
DOI: 10.1016/J.COR.2008.04.004
description: scientific article; zbMATH DE number 5383156