We analyze the problem of computing the Banzhaf and Shapley power indices for graph restricted voting games, defined in a particular class of graphs, that we called line-clique. A line-clique graph is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback