IDEAS home Printed from https://ideas.repec.org/a/kap/theord/v80y2016i1d10.1007_s11238-014-9422-7.html
   My bibliography  Save this article

Computational complexity in the design of voting rules

Author

Listed:
  • Koji Takamiya

    () (Niigata University)

  • Akira Tanaka

    () (Graduate School of Information Science and Technology, Hokkaido University)

Abstract

Abstract This paper considers the computational complexity of the design of voting rules, which is formulated by simple games. We prove that it is an NP -complete problem to decide whether a given simple game is stable, or not.

Suggested Citation

  • Koji Takamiya & Akira Tanaka, 2016. "Computational complexity in the design of voting rules," Theory and Decision, Springer, vol. 80(1), pages 33-41, January.
  • Handle: RePEc:kap:theord:v:80:y:2016:i:1:d:10.1007_s11238-014-9422-7
    DOI: 10.1007/s11238-014-9422-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11238-014-9422-7
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Boros, Endre & Gurvich, Vladimir, 2000. "Stable effectivity functions and perfect graphs," Mathematical Social Sciences, Elsevier, vol. 39(2), pages 175-194, March.
    2. 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.
    3. 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.
    4. 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.
    Full references (including those not matched with items on IDEAS)

    Corrections

    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 CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.