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 3 5 1,069
Arrow's Theorem and Turing Computability 0 1 4 930 3 7 19 3,343
Arrow's Theorem and Turing Computability 0 0 0 0 0 0 11 457
Arrow's Theorem, countably many agents, and more visible invisible dictators 0 1 3 664 6 11 37 3,086
Arrow's theorem, Weglorz' models and the axiom of choice 0 0 0 297 0 2 8 1,721
Characterizing the Borda ranking rule for a fixed population 0 0 3 43 1 4 14 146
Coalitionally strategyproof functions depend only on the most-preferred alternatives 0 0 0 72 0 2 5 453
Computability of simple games: A characterization and application to the core 0 0 2 227 3 4 20 1,061
Computability of simple games: A complete investigation of the sixty-four possibilities 0 0 0 137 0 2 6 785
Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof 0 0 0 203 1 2 8 1,010
Nonanonymity and sensitivity of computable simple games 0 0 0 94 0 1 12 453
Preference aggregation theory without acyclicity: The core without majority dissatisfaction 0 0 1 169 2 6 19 652
The Nakamura numbers for computable simple games 0 0 3 235 1 4 25 1,330
The second-price auction solves King Solomon's dilemma 0 0 1 227 0 5 18 1,034
Total Working Papers 0 2 17 3,496 18 53 207 16,600

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

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