Access Statistics for H. Reiju Mihara

Author contact details at EconPapers.

Working Paper	File Downloads				Abstract Views
Working Paper	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	2	4	15	172	3	7	29	912
Arrow's Theorem and Turing Computability	0	0	0	0	3	5	25	331
Arrow's Theorem and Turing Computability	2	3	18	751	5	7	51	2,406
Arrow's Theorem, countably many agents, and more visible invisible dictators	1	2	18	331	5	7	43	1,563
Arrow's theorem, Weglorz' models and the axiom of choice	0	1	16	250	8	15	57	1,505
Coalitionally strategyproof functions depend only on the most-preferred alternatives	0	1	2	68	0	3	11	412
Computability of simple games: A characterization and application to the core	0	3	10	99	5	14	49	386
Computability of simple games: A complete investigation of the sixty-four possibilities	0	2	13	79	3	16	82	440
Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof	2	4	10	187	4	8	41	866
Nonanonymity and sensitivity of computable simple games	1	2	4	82	3	7	24	366
Preference aggregation theory without acyclicity: The core without majority dissatisfaction	0	6	49	49	6	20	113	113
The Nakamura numbers for computable simple games	0	2	11	67	7	16	56	256
The second-price auction solves King Solomon's dilemma	2	10	30	74	10	28	99	220
Total Working Papers	10	40	196	2,209	62	153	680	9,776

Journal Article	File Downloads				Abstract Views
Journal Article	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	2	5	37	1	3	18	285
Arrow's Theorem and Turing computability	0	1	8	162	1	5	27	1,405
Arrow's theorem, countably many agents, and more visible invisible dictators1	0	0	5	27	0	0	16	134
Coalitionally strategyproof functions depend only on the most-preferred alternatives	0	0	2	11	0	2	4	76
Computability of simple games: A characterization and application to the core	0	1	7	13	2	4	18	40
Existence of a coalitionally strategyproof social choice function: A constructive proof	0	1	3	23	0	1	10	118
Nonanonymity and sensitivity of computable simple games	0	1	2	17	0	1	7	128
The Nakamura numbers for computable simple games	0	0	5	5	1	2	15	15
Total Journal Articles	0	6	37	295	5	18	115	2,201

Authors with papers registered in the RePEc Author Service.

Authors with no registered papers

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

LogEc is hosted by the Swedish Business School at Örebro University.

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

Statistics updated 2009-11-04