| Article ID: | iaor200937811 |
| Country: | Germany |
| Volume: | 166 |
| Issue: | 1 |
| Start Page Number: | 243 |
| End Page Number: | 260 |
| Publication Date: | Feb 2009 |
| Journal: | Annals of Operations Research |
| Authors: | Freixas Josep, Molinero Xavier |
| Keywords: | programming: integer |
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.