| Article ID: | iaor19931937 |
| Country: | India |
| Volume: | 29 |
| Issue: | 4 |
| Start Page Number: | 284 |
| End Page Number: | 290 |
| Publication Date: | Dec 1992 |
| Journal: | OPSEARCH |
| Authors: | Goel Rajiv |
In this paper the author presents some results for weighted majority games. Also, a polynomial time algorithm is presented here, which accepts as inputs the minimal winning coalitions for a decisive simple game and produces as output either a quota weights vector which represent the game or a proof that the game is not a weighted majority game.