Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output
The Shapley-Shubik index is a specialization of the Shapley value and is widely applied to evaluate the power distribution in committees drawing binary decisions. It was generalized to decisions with more than two levels of approval both in the input and the output. The corresponding games are called $(j,k)$ simple games. Here we present a new axiomatization for the Shapley-Shubik index for $(j,k)$ simple games as well as for a continuous variant, which may be considered as the limit case.
PDF AbstractCategories
Computer Science and Game Theory
Datasets
Add Datasets
introduced or used in this paper
