Efficient sampling algorithms for plurality-voting power indices
Develop efficient sampling algorithms for estimating the Banzhaf and Shapley power indices in plurality-voting ensembles with random tie-breaking, especially for the multiclass classification setting, potentially by reusing samples across different base classifiers.
References
We remark that obtaining efficient sampling algorithms for our formulation remains an interesting and challenging open direction, especially for the multiclass case.
— Exact power indices for plurality-voting ensembles
(2610.17980 - Sarpe et al., 13 Oct 2026) in Appendix, Section appsec:bl, “Monte-Carlo sampling baseline”