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 |
0 |
1 |
1,064 |
| Arrow's Theorem and Turing Computability |
0 |
0 |
2 |
926 |
0 |
1 |
10 |
3,324 |
| Arrow's Theorem and Turing Computability |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
446 |
| Arrow's Theorem, countably many agents, and more visible invisible dictators |
0 |
3 |
9 |
661 |
1 |
12 |
32 |
3,049 |
| Arrow's theorem, Weglorz' models and the axiom of choice |
0 |
0 |
1 |
297 |
0 |
0 |
2 |
1,713 |
| Characterizing the Borda ranking rule for a fixed population |
0 |
0 |
3 |
40 |
0 |
4 |
19 |
132 |
| Coalitionally strategyproof functions depend only on the most-preferred alternatives |
0 |
0 |
0 |
72 |
0 |
0 |
2 |
448 |
| Computability of simple games: A characterization and application to the core |
0 |
0 |
1 |
225 |
0 |
1 |
8 |
1,041 |
| Computability of simple games: A complete investigation of the sixty-four possibilities |
0 |
0 |
0 |
137 |
0 |
0 |
0 |
779 |
| Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof |
0 |
0 |
0 |
203 |
0 |
0 |
1 |
1,002 |
| Nonanonymity and sensitivity of computable simple games |
0 |
0 |
0 |
94 |
0 |
0 |
0 |
441 |
| Preference aggregation theory without acyclicity: The core without majority dissatisfaction |
0 |
1 |
1 |
168 |
0 |
3 |
7 |
633 |
| The Nakamura numbers for computable simple games |
0 |
0 |
5 |
232 |
0 |
5 |
29 |
1,305 |
| The second-price auction solves King Solomon's dilemma |
0 |
0 |
2 |
226 |
1 |
1 |
8 |
1,016 |
| Total Working Papers |
0 |
4 |
24 |
3,479 |
2 |
28 |
122 |
16,393 |
|
|
LogEc is hosted by the
Örebro University School of Business.