Rights accessRestricted access - publisher's policy
A basic problem in the theory of simple games and other fields is to study whether
a simple game (Boolean function) is weighted (linearly separable). A second related problem
consists in studying whether a weighted game has a minimum integer realization. In this
paper we simultaneously analyze both problems by using linear programming.
For less than 9 voters, we find that there are 154 weighted games without minimum
integer realization, but all of them have minimum normalized realization. Isbell in 1958 was
the first to find a weighted game without a minimum normalized realization, he needed to
consider 12 voters to construct a game with such a property. The main result of this work
proves the existence of weighted games with this property with less than 12 voters
CitationFreixas, J.; Molinero, X. On the existence of a minimum integer representation for weighted voting systems. "Annals of operations research", Febrer 2009, vol. 166, núm. 1, p. 243-260.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com