2000 character limit reached
Weighted simple games and the topology of simplicial complexes (2210.09771v2)
Published 18 Oct 2022 in physics.soc-ph and math.CO
Abstract: We use simplicial complexes to model weighted voting games where certain coalitions are considered unlikely or impossible. Expressions for Banzhaf and Shapley-Shubik power indices for such games in terms of the topology of simplicial complexes are provided. We calculate the indices in several examples of weighted voting games with unfeasible coalitions, including the U.S. Electoral College and the Parliament of Bosnia-Herzegovina.