<p>We use simplicial complexes to model simple games as well as weighted voting games where certain coalitions are considered impossible. Topological characterizations of various ideas from simple games are provided, as are the expressions for Banzhaf and Shapley–Shubik power indices for weighted games. We calculate the indices in several examples of weighted voting games with unfeasible coalitions, including the U.S.&#xa0;Electoral College and the Parliament of Bosnia–Herzegovina.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Weighted simple games and the topology of simplicial complexes

  • Anastasia Brooks,
  • Franjo Šarčević,
  • Ismar Volić

摘要

We use simplicial complexes to model simple games as well as weighted voting games where certain coalitions are considered impossible. Topological characterizations of various ideas from simple games are provided, as are the expressions for Banzhaf and Shapley–Shubik power indices for weighted games. 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.