Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/87403
Authors: 
Muns, Sander
Year of Publication: 
2011
Series/Report no.: 
Tinbergen Institute Discussion Paper 11-124/2
Abstract: 
We consider a cooperative game with a bipartition that indicates which players are participating. This paper provides an analytical solution for the Shapley value when the worth of a coalition only depends on the number of participating coalition players. The computational complexity grows linearly in the number of players, which contrasts with the usual exponential increase. Our result remains true when we introduce (i) randomization of the bipartition, and (ii) randomly draw a characteristic function.
Subjects: 
Shapley value
computational complexity
bipartition
JEL: 
C71
Persistent Identifier of the first edition: 
Document Type: 
Working Paper

Files in This Item:
File
Size
156.69 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.