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 |
1 |
1 |
2 |
1,066 |
| Arrow's Theorem and Turing Computability |
0 |
1 |
4 |
928 |
4 |
5 |
13 |
3,332 |
| Arrow's Theorem and Turing Computability |
0 |
0 |
0 |
0 |
7 |
11 |
12 |
457 |
| Arrow's Theorem, countably many agents, and more visible invisible dictators |
0 |
0 |
8 |
663 |
3 |
10 |
43 |
3,071 |
| Arrow's theorem, Weglorz' models and the axiom of choice |
0 |
0 |
1 |
297 |
0 |
2 |
4 |
1,716 |
| Characterizing the Borda ranking rule for a fixed population |
0 |
2 |
3 |
43 |
3 |
8 |
18 |
142 |
| Coalitionally strategyproof functions depend only on the most-preferred alternatives |
0 |
0 |
0 |
72 |
2 |
2 |
3 |
451 |
| Computability of simple games: A characterization and application to the core |
0 |
2 |
2 |
227 |
6 |
10 |
16 |
1,054 |
| Computability of simple games: A complete investigation of the sixty-four possibilities |
0 |
0 |
0 |
137 |
3 |
4 |
4 |
783 |
| Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof |
0 |
0 |
0 |
203 |
4 |
5 |
6 |
1,008 |
| Nonanonymity and sensitivity of computable simple games |
0 |
0 |
0 |
94 |
4 |
7 |
9 |
450 |
| Preference aggregation theory without acyclicity: The core without majority dissatisfaction |
0 |
0 |
2 |
169 |
9 |
10 |
16 |
645 |
| The Nakamura numbers for computable simple games |
0 |
2 |
3 |
235 |
3 |
11 |
26 |
1,321 |
| The second-price auction solves King Solomon's dilemma |
0 |
0 |
0 |
226 |
6 |
7 |
10 |
1,025 |
| Total Working Papers |
0 |
7 |
23 |
3,492 |
55 |
93 |
182 |
16,521 |
|
|
LogEc is hosted by the
Örebro University School of Business.