134 citations
- The University of TokyoJP27 papers
- National Astronomical Observatory of JapanJP24 papers
- Nagoya UniversityJP23 papers
- National Institutes of Natural SciencesJP22 papers
- Tokushima UniversityJP22 papers
- Université de MontréalCA22 papers
- Centre for Research in Astrophysics of QuébecCA21 papers
- Centre National de la Recherche ScientifiqueFR21 papers
- Herzberg Institute of AstrophysicsCA21 papers
- Hiroshima UniversityJP21 papers
- Korea Astronomy and Space Science InstituteKR21 papers
- Chinese Academy of SciencesCN20 papers
5 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…
The second-price auction solves King Solomon's dilemma
H. Reiju Mihara
The planner wants to give k identical, indivisible objects to the top k valuation agents at zero costs. Each agent knows her own valuation of the object and whether it is among the…
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…