pith. sign in

arxiv: 1601.06223 · v1 · pith:6AEFZBHQnew · submitted 2016-01-23 · 💻 cs.GT

Shapley Values in Weighted Voting Games with Random Weights

classification 💻 cs.GT
keywords shapleyvaluesvotingdistributionweightedagentgamegames
0
0 comments X
read the original abstract

We investigate the distribution of the well-studied Shapley--Shubik values in weighted voting games where the agents are stochastically determined. The Shapley--Shubik value measures the voting power of an agent, in typical collective decision making systems. While easy to estimate empirically given the parameters of a weighted voting game, the Shapley values are notoriously hard to reason about analytically. We propose a probabilistic approach in which the agent weights are drawn i.i.d. from some known exponentially decaying distribution. We provide a general closed-form characterization of the highest and lowest expected Shapley values in such a game, as a function of the parameters of the underlying distribution. To do so, we give a novel reinterpretation of the stochastic process that generates the Shapley variables as a renewal process. We demonstrate the use of our results on the uniform and exponential distributions. Furthermore, we show the strength of our theoretical predictions on several synthetic datasets.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.