| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777230 | Electronic Notes in Discrete Mathematics | 2016 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sascha Kurz, Xavier Molinero, Martin Olsen, Maria Serna,