Preference aggregation theory without acyclicity: The core without majority dissatisfaction
Year of publication: |
2008-11-24
|
---|---|
Authors: | Kumabe, Masahiro ; Mihara, H. Reiju |
Institutions: | Volkswirtschaftliche Fakultät, Ludwig-Maximilians-Universität München |
Subject: | Core | Nakamura number | kappa number | simple games | voting games | maximal elements | acyclic preferences | limit ordinals |
-
Preference Aggregation Theory Without Acyclicity : The Core Without Majority Dissatisfaction
Kumabe, Masahiro, (2011)
-
The Nakamura numbers for computable simple games
Kumabe, Masahiro, (2007)
-
Computational complexity in the design of voting systems
Takamiya, Koji, (2006)
- More ...
-
Computability of simple games: A complete investigation of the sixty-four possibilities
Kumabe, Masahiro, (2006)
-
Computability of simple games: A characterization and application to the core
Kumabe, Masahiro, (2006)
-
The Nakamura numbers for computable simple games
Kumabe, Masahiro, (2007)
- More ...