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 2 1,066
Arrow's Theorem and Turing Computability 0 1 3 929 1 8 13 3,336
Arrow's Theorem and Turing Computability 0 0 0 0 0 7 12 457
Arrow's Theorem, countably many agents, and more visible invisible dictators 0 0 5 663 3 7 38 3,075
Arrow's theorem, Weglorz' models and the axiom of choice 0 0 0 297 1 3 6 1,719
Characterizing the Borda ranking rule for a fixed population 0 0 3 43 0 3 14 142
Coalitionally strategyproof functions depend only on the most-preferred alternatives 0 0 0 72 0 2 3 451
Computability of simple games: A characterization and application to the core 0 0 2 227 2 9 17 1,057
Computability of simple games: A complete investigation of the sixty-four possibilities 0 0 0 137 0 3 4 783
Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof 0 0 0 203 0 4 6 1,008
Nonanonymity and sensitivity of computable simple games 0 0 0 94 0 6 11 452
Preference aggregation theory without acyclicity: The core without majority dissatisfaction 0 0 2 169 1 10 16 646
The Nakamura numbers for computable simple games 0 0 3 235 1 8 26 1,326
The second-price auction solves King Solomon's dilemma 0 1 1 227 1 10 14 1,029
Total Working Papers 0 2 19 3,494 10 81 182 16,547

Journal Article 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 50 2 9 12 369
Arrow's Theorem and Turing computability 0 0 2 229 2 12 21 1,630
Arrow's theorem, countably many agents, and more visible invisible dictators1 0 0 1 50 0 13 21 242
Coalitionally strategyproof functions depend only on the most-preferred alternatives 0 0 0 16 1 2 10 121
Computability of simple games: A characterization and application to the core 0 0 1 30 0 2 8 166
Computability of simple games: A complete investigation of the sixty-four possibilities 0 0 0 11 0 15 16 103
Existence of a coalitionally strategyproof social choice function: A constructive proof 0 0 0 33 0 5 5 165
Nonanonymity and sensitivity of computable simple games 0 0 0 22 0 3 5 204
Preference aggregation theory without acyclicity: The core without majority dissatisfaction 0 0 0 22 2 15 21 157
THE SECOND-PRICE AUCTION SOLVES KING SOLOMON'S DILEMMA 0 0 0 17 0 10 12 120
The Nakamura numbers for computable simple games 0 0 0 29 0 4 9 148
Total Journal Articles 0 0 4 509 7 90 140 3,425

logo

LogEc Home

Top Working Papers
Top Journal Articles
Top Books
Top Chapters
Top Software Items

Top Authors

Top Working Paper series and Journals

About LogEc

Authors with papers registered in the RePEc Author Service.

Register yourself as an author or register more papers in the RePEc Author Service.

Authors with no registered papers

RePEc
LogEc provides access and usage statistics for services based on the RePEc data set.

Örebro UniversityLogEc is hosted by the Örebro University School of Business.

Questions or comments? Please see our explanation of how the statistics are collected or e-mail

Since October 2025, abstract view statistics are potentially heavily influenced by traffic from AI bots and tools that we could not eliminate despite our best efforts.

Statistics updated 2026-04-09