A Note on the Shapley Value for Characteristic Functions on Bipartitions

Research output: Working paperDiscussion paperOther research output

10 Downloads (Pure)

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.
Original languageEnglish
Place of PublicationDen Haag
PublisherCPB Netherlands Bureau for Economic Policy Analysis
Number of pages12
DOIs
Publication statusPublished - 28 Aug 2011
Externally publishedYes

Publication series

NameCPB Discussion Paper
Volume189

Keywords

  • Shapley value
  • computational complexity
  • bipartition

Fingerprint Dive into the research topics of 'A Note on the Shapley Value for Characteristic Functions on Bipartitions'. Together they form a unique fingerprint.

  • Cite this

    Muns, S. (2011). A Note on the Shapley Value for Characteristic Functions on Bipartitions. (CPB Discussion Paper ; Vol. 189). CPB Netherlands Bureau for Economic Policy Analysis. https://doi.org/10.2139/ssrn.1921323