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 5 1,069
Arrow's Theorem and Turing Computability 0 0 0 0 0 0 11 457
Arrow's Theorem and Turing Computability 1 1 5 931 1 4 20 3,344
Arrow's Theorem, countably many agents, and more visible invisible dictators 0 0 2 664 0 7 33 3,087
Arrow's theorem, Weglorz' models and the axiom of choice 0 0 0 297 0 0 8 1,721
Characterizing the Borda ranking rule for a fixed population 0 0 3 43 3 6 18 151
Coalitionally strategyproof functions depend only on the most-preferred alternatives 0 0 0 72 18 18 23 471
Computability of simple games: A characterization and application to the core 0 2 4 229 0 5 21 1,063
Computability of simple games: A complete investigation of the sixty-four possibilities 0 0 0 137 7 7 13 792
Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof 0 0 0 203 0 1 8 1,010
Nonanonymity and sensitivity of computable simple games 0 0 0 94 0 0 11 453
Preference aggregation theory without acyclicity: The core without majority dissatisfaction 0 0 0 169 0 2 18 652
The Nakamura numbers for computable simple games 0 1 3 236 0 2 23 1,331
The second-price auction solves King Solomon's dilemma 0 0 1 227 0 0 17 1,034
Total Working Papers 1 4 18 3,500 29 53 229 16,635

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 0 0 15 373
Arrow's Theorem and Turing computability 0 0 0 229 0 2 24 1,636
Arrow's theorem, countably many agents, and more visible invisible dictators1 0 0 1 50 0 1 20 245
Coalitionally strategyproof functions depend only on the most-preferred alternatives 0 0 0 16 3 6 10 127
Computability of simple games: A characterization and application to the core 0 0 1 30 0 2 11 170
Computability of simple games: A complete investigation of the sixty-four possibilities 0 0 0 11 0 1 17 105
Existence of a coalitionally strategyproof social choice function: A constructive proof 0 0 0 33 0 0 9 169
Nonanonymity and sensitivity of computable simple games 0 0 0 22 0 0 4 204
Preference aggregation theory without acyclicity: The core without majority dissatisfaction 0 0 0 22 1 1 26 164
THE SECOND-PRICE AUCTION SOLVES KING SOLOMON'S DILEMMA 0 0 0 17 1 1 16 125
The Nakamura numbers for computable simple games 0 0 0 29 0 0 12 152
Total Journal Articles 0 0 2 509 5 14 164 3,470

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-09-10