English, Article, Journal or magazine article edition: Computational Complexity in the Design of Voting Rules Koji Takamiya; Akira Tanaka

User activity

Share to:
 
Bookmark: http://trove.nla.gov.au/version/106859
Physical Description
  • preprint
Language
  • English

Edition details

Title
  • Computational Complexity in the Design of Voting Rules
Author
  • Koji Takamiya
  • Akira Tanaka
Physical Description
  • preprint
Notes
  • This paper discusses an aspect of computational complexity in social choice theory. We consider the problem of designing voting rules, which is formulated in terms of simple games. We prove that it is an NP-complete problem to decide whether a given simple game is stable, or not.
  • RePEc:dpr:wpaper:0653
Language
  • English
Contributed by
OAIster

Get this edition

Other links

  • Set up My libraries

    How do I set up "My libraries"?

    In order to set up a list of libraries that you have access to, you must first login or sign up. Then set up a personal list of libraries from your profile page by clicking on your user name at the top right of any screen.

  • All (1)
  • Unknown (1)
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.

User activity


e.g. test cricket, Perth (WA), "Parkes, Henry"

Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.

Be the first to add a tag for this edition

Be the first to add this to a list

Comments and reviews

What are comments? Add a comment

No user comments or reviews for this version

Add a comment