Access Statistics for H. Reiju Mihara
Author contact details at EconPapers.
| Working Paper |
File Downloads |
Abstract Views |
| Last month |
3 months |
12 months |
Total |
Last month |
3 months |
12 months |
Total |
| Anonymity and Neutrality in Arrow's Theorem with Restricted Coalition Algebras |
0 |
0 |
0 |
198 |
0 |
1 |
1 |
1,065 |
| Arrow's Theorem and Turing Computability |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
447 |
| Arrow's Theorem and Turing Computability |
0 |
1 |
3 |
927 |
0 |
3 |
11 |
3,327 |
| Arrow's Theorem, countably many agents, and more visible invisible dictators |
0 |
1 |
8 |
663 |
0 |
7 |
34 |
3,061 |
| Arrow's theorem, Weglorz' models and the axiom of choice |
0 |
0 |
1 |
297 |
1 |
2 |
4 |
1,715 |
| Characterizing the Borda ranking rule for a fixed population |
1 |
2 |
3 |
42 |
2 |
3 |
19 |
136 |
| Coalitionally strategyproof functions depend only on the most-preferred alternatives |
0 |
0 |
0 |
72 |
0 |
1 |
2 |
449 |
| Computability of simple games: A characterization and application to the core |
1 |
1 |
1 |
226 |
2 |
4 |
8 |
1,046 |
| Computability of simple games: A complete investigation of the sixty-four possibilities |
0 |
0 |
0 |
137 |
1 |
1 |
1 |
780 |
| Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof |
0 |
0 |
0 |
203 |
1 |
2 |
2 |
1,004 |
| Nonanonymity and sensitivity of computable simple games |
0 |
0 |
0 |
94 |
1 |
2 |
3 |
444 |
| Preference aggregation theory without acyclicity: The core without majority dissatisfaction |
0 |
0 |
2 |
169 |
0 |
1 |
7 |
635 |
| The Nakamura numbers for computable simple games |
1 |
1 |
4 |
234 |
5 |
7 |
25 |
1,315 |
| The second-price auction solves King Solomon's dilemma |
0 |
0 |
0 |
226 |
0 |
1 |
5 |
1,018 |
| Total Working Papers |
3 |
6 |
22 |
3,488 |
14 |
36 |
124 |
16,442 |
|
|
LogEc is hosted by the
Örebro University School of Business.