5 Pages Posted: 13 Feb 2016
Date Written: February 13, 2016
This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with linear dimension and exponential codimension with respect to the number of players.
Keywords: Simple games, Dimension, Codimension, Computational complexity
JEL Classification: C71, D72
Suggested Citation: Suggested Citation
Kurz, Sascha and Molinero, Xavier and Olsen, Martin and Serna, Maria, Dimension and Codimension of Simple Games (February 13, 2016). Available at SSRN: https://ssrn.com/abstract=2732046 or http://dx.doi.org/10.2139/ssrn.2732046