Computational complexity in the design of voting rules
Year of publication: |
January 2016
|
---|---|
Authors: | Takamiya, Koji ; Tanaka, Akira |
Published in: |
Theory and decision : an international journal for multidisciplinary advances in decision science. - Dordrecht [u.a.] : Springer, ISSN 0040-5833, ZDB-ID 189247-2. - Vol. 80.2016, 1, p. 33-41
|
Subject: | Computational complexity | NP-completeness | Simple game | Core | Stability | Nakamura number | Abstimmungsregel | Voting rule | Spieltheorie | Game theory |
-
Computational complexity in the design of voting systems
Takamiya, Koji, (2006)
-
Structural control in weighted voting games
Rey, Anja, (2018)
-
Characterization of the Pareto social choice correspondence
Kelly, Jerry S., (2020)
- More ...
-
Mutual knowledge of rationality in the electronic mail game
Takamiya, Koji, (2006)
-
Computational complexity in the design of voting systems
Takamiya, Koji, (2006)
-
Computational complexity in the design of voting systems
Takamiya, Koji, (2006)
- More ...