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, vol. 19(1), pages 1-9.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:49:y:2005:i:1:p:111-116. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.