Easy weighted majority games
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Mathematical Social Sciences.
Volume (Year): 40 (2000)
Issue (Month): 2 (September)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/505565
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.
- Ghosh, D. & Chakravarti, N. & Sierksma, G., 2000. "Sensitivity analysis of the greedy heuristic for binary knapsack problems," Research Report 00A18, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
- Berghammer, Rudolf & Bolus, Stefan, 2012. "On the use of binary decision diagrams for solving problems on simple games," European Journal of Operational Research, Elsevier, vol. 222(3), pages 529-541.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If references are entirely missing, you can add them using this form.