Abstract
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.
Original language | English |
---|---|
Journal | Electronic Notes in Discrete Mathematics |
Volume | 55 |
Pages (from-to) | 147-150 |
Number of pages | 3 |
ISSN | 1571-0653 |
DOIs | |
Publication status | Published - 1 Nov 2016 |
Keywords
- Codimension
- Computational complexity
- Dimension
- Simple games