Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras
DOI10.1287/moor.2017.0915zbMath1443.91028OpenAlexW2885045932MaRDI QIDQ5219709
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2017.0915
generating functionsClifford algebraBanzhaf power indexShapley-Shubik power indexweighted voting gamescoalition configurationlinear Diophantine systemcoalitional power indicesomega calculusdesign of voting systems
Cooperative games (91A12) Voting theory (91B12) Applications of Clifford algebras to physics, etc. (15A67)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum sum representation as an index of voting power
- Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
- Implementing generating functions to obtain power indices with coalition configuration
- A generating functions approach for computing the public good index efficiently
- A class of simple games
- Generating functions for coalitional power indices: an application to the IMF
- Reductions in computational complexity using Clifford algebras
- Weighted multiple majority games with unions: generating functions and applications to the European Union
- Cooperative games with coalition structures
- A new index of power for simple n-person games
- Computing power indices in weighted multiple majority games.
- A general algorithm for the MacMahon Omega operator
- MacMahon's partition analysis. VI: A new reduction algorithm
- Generating functions for computing the Myerson value
- Modification of the Banzhaf value for games with a coalition structure
- Partition analysis and symmetrizing operators
- A fast algorithm for MacMahon's partition analysis
- The inverse Banzhaf problem
- Computation of several power indices by generating functions
- Polyhedral omega: a new algorithm for solving linear Diophantine systems
- On Dedekind's problem for complete simple games
- A linear approximation method for the Shapley value
- Evaluation of Banzhaf index with restrictions on coalitions formation
- On Ehrhart polynomials and probability calculations in voting theory
- Coalition configurations and the Banzhaf index
- A note on hierarchies in weighted voting games and partitions
- Linear homogeneous Diophantine equations and magic labelings of graphs
- SOME OPEN PROBLEMS IN SIMPLE GAMES
- Power, Voting, and Voting Power: 30 Years After
- MacMahon’s Dream
- On the inverse power index problem
- MEASURING THE POWER OF PARTIES WITHIN GOVERNMENT COALITIONS
- On computational complexity of Clifford algebra
- Graphs and Cooperation in Games
- Mathematical Properties of the Banzhaf Power Index
- Generating functions for computing power indices efficiently
- MacMahon's partition analysis: The Omega package
This page was built for publication: Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras
