Faster algorithms for computing power indices in weighted voting games
No abstract is available for this item.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Prasad, K & Kelly, J S, 1990. "NP-Completeness of Some Problems Concerning Voting Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 19(1), pages 1-9.
- repec:cup:apsrev:v:48:y:1954:i:03:p:787-792_00 is not listed on IDEAS