
The core message of this article is to investigate the tractability of computing expected Shapley-like scores of Boolean functions, which combine the computation of power indices and probabilistic settings, and to apply the results to probabilistic databases.


coremsg

efficient-computation-of-expected-shapley-like-scores-for-boolean-functions-and-applications-to-probabilistic-databases


Efficient Computation of Expected Shapley-Like Scores for Boolean Functions and Applications to Probabilistic Databases
