Computational complexity in the design of voting rules
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Boros, Endre & Gurvich, Vladimir, 2000. "Stable effectivity functions and perfect graphs," Mathematical Social Sciences, Elsevier, vol. 39(2), pages 175-194, March.
- Masahiro Kumabe & H. Reiju Mihara, 2008. "The Nakamura numbers for computable simple games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(4), pages 621-640, December.
- Kumabe, Masahiro & Mihara, H. Reiju, 2008.
"Computability of simple games: A characterization and application to the core,"
Journal of Mathematical Economics,
Elsevier, vol. 44(3-4), pages 348-366, February.
- Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A characterization and application to the core," MPRA Paper 437, University Library of Munich, Germany.
- Mizutani, Masayoshi & Hiraide, Yasuhiko & Nishino, Hisakazu, 1993. "Computational Complexity to Verify the Unstability of Effectivity Function," International Journal of Game Theory, Springer;Game Theory Society, vol. 22(3), pages 225-239.
More about this item
KeywordsComputational complexity; NP-completeness; Simple game; Core; Stability; Nakamura number;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:theord:v:80:y:2016:i:1:d:10.1007_s11238-014-9422-7. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.