IDEAS home Printed from https://ideas.repec.org/e/pmi193.html
   My authors  Follow this author

H. Reiju Mihara

Personal Details

First Name:H. Reiju
Middle Name:
Last Name:Mihara
Suffix:
RePEc Short-ID:pmi193
[This author has chosen not to make the email address public]
http://www5.atwiki.jp/reiju/
Kagawa University Library, Takamatsu 760-8525, Japan
Twitter: @reiju21jp
Terminal Degree:1995 Department of Economics; University of Minnesota (from RePEc Genealogy)

Affiliation

Kagawa University Library

http://www.lib.kagawa-u.ac.jp/
Kagawa, Japan

Research output

as
Jump to: Working papers Articles

Working papers

  1. Mihara, H. Reiju, 2017. "Characterizing the Borda ranking rule for a fixed population," MPRA Paper 78093, University Library of Munich, Germany.
  2. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," MPRA Paper 11728, University Library of Munich, Germany.
  3. Mihara, H. Reiju, 2008. "The second-price auction solves King Solomon's dilemma," MPRA Paper 8801, University Library of Munich, Germany.
  4. Kumabe, Masahiro & Mihara, H. Reiju, 2007. "The Nakamura numbers for computable simple games," MPRA Paper 3684, University Library of Munich, Germany.
  5. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A characterization and application to the core," MPRA Paper 437, University Library of Munich, Germany.
  6. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A complete investigation of the sixty-four possibilities," MPRA Paper 440, University Library of Munich, Germany.
  7. H. Reiju Mihara, 2003. "Nonanonymity and sensitivity of computable simple games," Game Theory and Information 0310006, EconWPA, revised 01 Jun 2004.
  8. Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, EconWPA, revised 01 Jun 2004.
  9. H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 01 Jun 2004.
  10. H. Reiju Mihara, 1996. "Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof," Public Economics 9604002, EconWPA, revised 01 Jun 2004.
  11. H. Reiju Mihara, 1996. "Coalitionally strategyproof functions depend only on the most-preferred alternatives," Public Economics 9604003, EconWPA, revised 01 Jun 2004.
  12. H. Reiju Mihara, 1994. "Anonymity and Neutrality in Arrow's Theorem with Restricted Coalition Algebras," Public Economics 9411001, EconWPA, revised 07 Sep 1998.
  13. Mihara, H.R., 1994. "Arrow's Theorem and Turing Computability," Papers 276, Minnesota - Center for Economic Research.

Articles

  1. H. Reiju Mihara, 2012. "The Second-Price Auction Solves King Solomon'S Dilemma," The Japanese Economic Review, Japanese Economic Association, vol. 63(3), pages 420-429, September.
  2. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," Games and Economic Behavior, Elsevier, vol. 72(1), pages 187-201, May.
  3. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Computability of simple games: A complete investigation of the sixty-four possibilities," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 150-158, March.
  4. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
  5. Masahiro Kumabe & H. Reiju Mihara, 2008. "The Nakamura numbers for computable simple games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(4), pages 621-640, December.
  6. Mihara, H. Reiju, 2004. "Nonanonymity and sensitivity of computable simple games," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 329-341, November.
  7. H. Reiju Mihara, 2001. "Existence of a coalitionally strategyproof social choice function: A constructive proof," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(3), pages 543-553.
  8. H. Reiju Mihara, 2000. "Coalitionally strategyproof functions depend only on the most-preferred alternatives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 17(3), pages 393-402.
  9. Mihara, H. Reiju, 1999. "Arrow's theorem, countably many agents, and more visible invisible dictators1," Journal of Mathematical Economics, Elsevier, vol. 32(3), pages 267-287, November.
  10. H. Reiju Mihara, 1997. "Anonymity and neutrality in Arrow's Theorem with restricted coalition algebras," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 14(4), pages 503-512.
  11. H. Reiju Mihara, 1997. "Arrow's Theorem and Turing computability," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 10(2), pages 257-276.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Wikipedia mentions

(Only mentions on Wikipedia that link back to a page on a RePEc service)
  1. H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 01 Jun 2004.

    Mentioned in:

    1. Arrow's impossibility theorem in Wikipedia (English)
    2. الگو:Cite doi/10.1016.2FS0304-4068.2898.2900061-5 in Wikipedia (Persian)
    3. Ultrafilter in Wikipedia (English)
    4. Template:Cite doi/10.1016.2FS0304-4068.2898.2900061-5 in Wikipedia (Japanese)
    5. Txantiloi:Cite doi/10.1016.2FS0304-4068.2898.2900061-5 in Wikipedia (Basque)
  2. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A characterization and application to the core," MPRA Paper 437, University Library of Munich, Germany.

    Mentioned in:

    1. Rice's theorem in Wikipedia (English)
    2. الگو:Cite doi/10.1016.2Fj.jmateco.2007.05.012 in Wikipedia (Persian)
    3. Template:Cite doi/10.1016.2Fj.jmateco.2007.05.012 in Wikipedia (Japanese)
    4. Txantiloi:Cite doi/10.1016.2Fj.jmateco.2007.05.012 in Wikipedia (Basque)
  3. H. Reiju Mihara, 1994. "Arrow's Theorem and Turing Computability," Public Economics 9408001, EconWPA, revised 06 Aug 1998.

    Mentioned in:

    1. Filtro (matematica) in Wikipedia (Italian)
  4. Kumabe, Masahiro & Mihara, H. Reiju, 2007. "The Nakamura numbers for computable simple games," MPRA Paper 3684, University Library of Munich, Germany.

    Mentioned in:

    1. Rice's theorem in Wikipedia (English)
    2. Cooperative game theory in Wikipedia (English)
    3. لعبة تعاونية in Wikipedia (Arabic)
    4. الگو:Cite doi/10.1007.2Fs00355-008-0300-5 in Wikipedia (Persian)
    5. Nakamura number in Wikipedia (English)
    6. Template:Cite doi/10.1007.2Fs00355-008-0300-5 in Wikipedia (Japanese)
    7. Txantiloi:Cite doi/10.1007.2Fs00355-008-0300-5 in Wikipedia (Basque)

Working papers

  1. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," MPRA Paper 11728, University Library of Munich, Germany.

    Cited by:

    1. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A complete investigation of the sixty-four possibilities," MPRA Paper 440, University Library of Munich, Germany.
    2. Momo Kenfack, Joseph Armel & Pongou, Roland & Tchantcho, Bertrand, 2014. "The stability of decision making in committees: The one-core," Economics Letters, Elsevier, vol. 122(3), pages 390-395.
    3. Mihara, H. Reiju, 2017. "Characterizing the Borda ranking rule for a fixed population," MPRA Paper 78093, University Library of Munich, Germany.

  2. Mihara, H. Reiju, 2008. "The second-price auction solves King Solomon's dilemma," MPRA Paper 8801, University Library of Munich, Germany.

    Cited by:

    1. Elbittar, Alexander & Di Giannatale, Sonia, 2017. "“Neither I nor you shall have him”: An experimental study of the King Solomon's Dilemma," Journal of Behavioral and Experimental Economics (formerly The Journal of Socio-Economics), Elsevier, vol. 70(C), pages 55-69.
    2. Alexander Elbittar & Sonia B. Di Giannatale, 2010. "King Solomon’s Dilemma: An Experimental Study on Implementation," Working papers DTE 477, CIDE, División de Economía.
    3. Brishti Guha, 2017. "Testing for Malice," Economics Bulletin, AccessEcon, vol. 37(1), pages 327-335.

  3. Kumabe, Masahiro & Mihara, H. Reiju, 2007. "The Nakamura numbers for computable simple games," MPRA Paper 3684, University Library of Munich, Germany.

    Cited by:

    1. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," Games and Economic Behavior, Elsevier, vol. 72(1), pages 187-201, May.
    2. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A complete investigation of the sixty-four possibilities," MPRA Paper 440, University Library of Munich, Germany.
    3. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
    4. Koji Takamiya & Akira Tanaka, 2016. "Computational complexity in the design of voting rules," Theory and Decision, Springer, vol. 80(1), pages 33-41, January.

  4. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A characterization and application to the core," MPRA Paper 437, University Library of Munich, Germany.

    Cited by:

    1. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," Games and Economic Behavior, Elsevier, vol. 72(1), pages 187-201, May.
    2. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A complete investigation of the sixty-four possibilities," MPRA Paper 440, University Library of Munich, Germany.
    3. Masahiro Kumabe & H. Reiju Mihara, 2008. "The Nakamura numbers for computable simple games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(4), pages 621-640, December.
    4. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
    5. Koji Takamiya & Akira Tanaka, 2016. "Computational complexity in the design of voting rules," Theory and Decision, Springer, vol. 80(1), pages 33-41, January.

  5. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A complete investigation of the sixty-four possibilities," MPRA Paper 440, University Library of Munich, Germany.

    Cited by:

    1. Masahiro Kumabe & H. Reiju Mihara, 2008. "The Nakamura numbers for computable simple games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(4), pages 621-640, December.
    2. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.

  6. H. Reiju Mihara, 2003. "Nonanonymity and sensitivity of computable simple games," Game Theory and Information 0310006, EconWPA, revised 01 Jun 2004.

    Cited by:

    1. Kari Saukkonen, 2007. "Continuity of social choice functions with restricted coalition algebras," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 28(4), pages 637-647, June.
    2. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A complete investigation of the sixty-four possibilities," MPRA Paper 440, University Library of Munich, Germany.
    3. Masahiro Kumabe & H. Reiju Mihara, 2008. "The Nakamura numbers for computable simple games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(4), pages 621-640, December.
    4. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.

  7. H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 01 Jun 2004.

    Cited by:

    1. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," Games and Economic Behavior, Elsevier, vol. 72(1), pages 187-201, May.
    2. H. Reiju Mihara, 2003. "Nonanonymity and sensitivity of computable simple games," Game Theory and Information 0310006, EconWPA, revised 01 Jun 2004.
    3. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A complete investigation of the sixty-four possibilities," MPRA Paper 440, University Library of Munich, Germany.
    4. Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, EconWPA, revised 01 Jun 2004.
    5. Potgieter, Petrus H. & Rosinger, Elemér E., 2007. "Is Economics Entering its Post-Witchcraft Era?," MPRA Paper 3340, University Library of Munich, Germany.
    6. Mabrouk, Mohamed, 2006. "Allais-anonymity as an alternative to the discounted-sum criterion in the calculus of optimal growth I: Consensual optimality," MPRA Paper 10512, University Library of Munich, Germany.
    7. Andrei Gomberg & Cesar Martinelli & Ricard Torres, 2002. "Anonymity in Large Societies," Working Papers 0211, Centro de Investigacion Economica, ITAM.
    8. Ricard Torres, 2002. "Smallness of Invisible Dictators," Working Papers 0213, Centro de Investigacion Economica, ITAM, revised Sep 2003.

  8. H. Reiju Mihara, 1996. "Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof," Public Economics 9604002, EconWPA, revised 01 Jun 2004.

    Cited by:

    1. H. Reiju Mihara, 1997. "Arrow's Theorem and Turing computability," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 10(2), pages 257-276.
    2. Kari Saukkonen, 2007. "Continuity of social choice functions with restricted coalition algebras," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 28(4), pages 637-647, June.
    3. Torres, Ricard, 2005. "Limiting Dictatorial rules," Journal of Mathematical Economics, Elsevier, vol. 41(7), pages 913-935, November.
    4. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
    5. Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, EconWPA, revised 01 Jun 2004.
    6. H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 01 Jun 2004.

  9. H. Reiju Mihara, 1996. "Coalitionally strategyproof functions depend only on the most-preferred alternatives," Public Economics 9604003, EconWPA, revised 01 Jun 2004.

    Cited by:

    1. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," Games and Economic Behavior, Elsevier, vol. 72(1), pages 187-201, May.
    2. Yohei Sekiguchi, 2012. "A Characterization of the Plurality Rule," CIRJE F-Series CIRJE-F-833, CIRJE, Faculty of Economics, University of Tokyo.
    3. Kari Saukkonen, 2007. "Continuity of social choice functions with restricted coalition algebras," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 28(4), pages 637-647, June.
    4. Sekiguchi, Yohei, 2012. "A characterization of the plurality rule," Economics Letters, Elsevier, vol. 116(3), pages 330-332.
    5. Chun-Hsien Yeh, 2008. "An efficiency characterization of plurality rule in collective choice problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 34(3), pages 575-583, March.
    6. Yeh, Chun-Hsien, 2006. "Reduction-consistency in collective choice problems," Journal of Mathematical Economics, Elsevier, vol. 42(6), pages 637-652, September.

  10. H. Reiju Mihara, 1994. "Anonymity and Neutrality in Arrow's Theorem with Restricted Coalition Algebras," Public Economics 9411001, EconWPA, revised 07 Sep 1998.

    Cited by:

    1. H. Reiju Mihara, 1997. "Arrow's Theorem and Turing computability," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 10(2), pages 257-276.
    2. H. Reiju Mihara, 2003. "Nonanonymity and sensitivity of computable simple games," Game Theory and Information 0310006, EconWPA, revised 01 Jun 2004.
    3. Kari Saukkonen, 2007. "Continuity of social choice functions with restricted coalition algebras," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 28(4), pages 637-647, June.
    4. Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, EconWPA, revised 01 Jun 2004.
    5. Cato Susumu, 2018. "Hybrid Invariance and Oligarchic Structures," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 18(1), pages 1-12, January.
    6. Andrei Gomberg & Cesar Martinelli & Ricard Torres, 2002. "Anonymity in Large Societies," Working Papers 0211, Centro de Investigacion Economica, ITAM.
    7. Cato, Susumu, 2017. "Unanimity, anonymity, and infinite population," Journal of Mathematical Economics, Elsevier, vol. 71(C), pages 28-35.
    8. Ricard Torres, 2002. "Smallness of Invisible Dictators," Working Papers 0213, Centro de Investigacion Economica, ITAM, revised Sep 2003.

  11. Mihara, H.R., 1994. "Arrow's Theorem and Turing Computability," Papers 276, Minnesota - Center for Economic Research.

    Cited by:

    1. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," Games and Economic Behavior, Elsevier, vol. 72(1), pages 187-201, May.
    2. H. Reiju Mihara, 2003. "Nonanonymity and sensitivity of computable simple games," Game Theory and Information 0310006, EconWPA, revised 01 Jun 2004.
    3. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A complete investigation of the sixty-four possibilities," MPRA Paper 440, University Library of Munich, Germany.
    4. Masahiro Kumabe & H. Reiju Mihara, 2008. "The Nakamura numbers for computable simple games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(4), pages 621-640, December.
    5. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
    6. Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, EconWPA, revised 01 Jun 2004.
    7. Hannu Salonen & Kari Saukkonen, 2005. "On continuity of Arrovian social welfare functions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 25(1), pages 85-93, October.
    8. Mihara, H. Reiju, 2017. "Characterizing the Borda ranking rule for a fixed population," MPRA Paper 78093, University Library of Munich, Germany.
    9. Yasuhito Tanaka, 2009. "On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 32(1), pages 67-78, May.
    10. Andrei Gomberg & Cesar Martinelli & Ricard Torres, 2002. "Anonymity in Large Societies," Working Papers 0211, Centro de Investigacion Economica, ITAM.
    11. H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 01 Jun 2004.

Articles

  1. H. Reiju Mihara, 2012. "The Second-Price Auction Solves King Solomon'S Dilemma," The Japanese Economic Review, Japanese Economic Association, vol. 63(3), pages 420-429, September.
    See citations under working paper version above.
  2. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," Games and Economic Behavior, Elsevier, vol. 72(1), pages 187-201, May.
    See citations under working paper version above.
  3. Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Computability of simple games: A complete investigation of the sixty-four possibilities," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 150-158, March.
    See citations under working paper version above.
  4. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
    See citations under working paper version above.
  5. Masahiro Kumabe & H. Reiju Mihara, 2008. "The Nakamura numbers for computable simple games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(4), pages 621-640, December.
    See citations under working paper version above.
  6. Mihara, H. Reiju, 2004. "Nonanonymity and sensitivity of computable simple games," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 329-341, November.
    See citations under working paper version above.
  7. H. Reiju Mihara, 2001. "Existence of a coalitionally strategyproof social choice function: A constructive proof," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(3), pages 543-553. See citations under working paper version above.
  8. H. Reiju Mihara, 2000. "Coalitionally strategyproof functions depend only on the most-preferred alternatives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 17(3), pages 393-402.
    See citations under working paper version above.
  9. Mihara, H. Reiju, 1999. "Arrow's theorem, countably many agents, and more visible invisible dictators1," Journal of Mathematical Economics, Elsevier, vol. 32(3), pages 267-287, November.

    Cited by:

    1. H. Reiju Mihara, 2003. "Nonanonymity and sensitivity of computable simple games," Game Theory and Information 0310006, EconWPA, revised 01 Jun 2004.
    2. Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A complete investigation of the sixty-four possibilities," MPRA Paper 440, University Library of Munich, Germany.
    3. Mabrouk, Mohamed, 2006. "Allais-anonymity as an alternative to the discounted-sum criterion in the calculus of optimal growth I: Consensual optimality," MPRA Paper 10512, University Library of Munich, Germany.

  10. H. Reiju Mihara, 1997. "Anonymity and neutrality in Arrow's Theorem with restricted coalition algebras," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 14(4), pages 503-512.
    See citations under working paper version above.
  11. H. Reiju Mihara, 1997. "Arrow's Theorem and Turing computability," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 10(2), pages 257-276.
    See citations under working paper version above.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 9 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-CDM: Collective Decision-Making (4) 1998-10-02 1999-02-15 2007-06-30 2008-12-01
  2. NEP-GTH: Game Theory (4) 2006-11-12 2007-06-30 2008-05-31 2008-12-01
  3. NEP-MIC: Microeconomics (2) 1999-02-15 2017-04-23
  4. NEP-POL: Positive Political Economics (2) 1999-02-15 2008-12-01
  5. NEP-CBE: Cognitive & Behavioural Economics (1) 2006-12-04
  6. NEP-CMP: Computational Economics (1) 2003-11-03
  7. NEP-CTA: Contract Theory & Applications (1) 2008-05-31
  8. NEP-DCM: Discrete Choice Models (1) 2008-12-01
  9. NEP-EXP: Experimental Economics (1) 2008-05-31
  10. NEP-MFD: Microfinance (1) 2003-11-03
  11. NEP-PBE: Public Economics (1) 1998-10-02
  12. NEP-PUB: Public Finance (1) 1998-10-02
  13. NEP-UPT: Utility Models & Prospect Theory (1) 2008-12-01

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, H. Reiju Mihara should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.