5 citations · 11 across the 5 of their papers we have counts for
4 papers · 1 filter
The Nakamura numbers for computable simple games
Masahiro Kumabe, H. Reiju Mihara
The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with…
Preference aggregation theory without acyclicity: The core without majority dissatisfaction
Masahiro Kumabe, H. Reiju Mihara
Acyclicity of individual preferences is a minimal assumption in social choice theory. We replace that assumption by the direct assumption that preferences have maximal elements on…
Computability of simple games: A complete investigation of the sixty-four possibilities
Masahiro Kumabe, H. Reiju Mihara
Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four cl…
Computability of simple games: A characterization and application to the core
Masahiro Kumabe, H. Reiju Mihara
The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning c…