Skip to Main content Skip to Navigation
Journal articles

Confidence Intervals for the Shapley–Shubik Power Index in Markovian Games

Abstract : We consider simple Markovian games, in which several states succeed each other over time, following an exogenous discrete-time Markov chain. In each state, a different simple static game is played by the same set of players. We investigate the approximation of the Shapley–Shubik power index in simple Markovian games (SSM). We prove that an exponential number of queries on coalition values is necessary for any deterministic algorithm even to approximate SSM with polynomial accuracy. Motivated by this, we propose and study three randomized approaches to compute a confidence interval for SSM. They rest upon two different assumptions, static and dynamic, about the process through which the estimator agent learns the coalition values. Such approaches can also be utilized to compute confidence intervals for the Shapley value in any Markovian game. The proposed methods require a number of queries, which is polynomial in the number of players in order to achieve a polynomial accuracy.
Document type :
Journal articles
Complete list of metadata
Contributor : Konstantin Avrachenkov Connect in order to contact the contributor
Submitted on : Monday, December 8, 2014 - 4:04:49 PM
Last modification on : Thursday, January 20, 2022 - 5:28:23 PM




Konstantin Avrachenkov, Laura Cottatellucci, Lorenzo Maggi. Confidence Intervals for the Shapley–Shubik Power Index in Markovian Games. Dynamic Games and Applications, Springer Verlag, 2014, 4 (1), pp.10-31. ⟨10.1007/s13235-013-0079-6⟩. ⟨hal-01092383⟩



Record views