IDEAS home Printed from https://ideas.repec.org/p/fth/minner/276.html
   My bibliography  Save this paper

Arrow's Theorem and Turing Computability

Author

Listed:
  • Mihara, H.R.

Abstract

A social welfare function for a denumerable society satisfies {Pairwise Computability} if for each pair (x, y) of alternatives, there exists an algorithm that can decide from any description of each profile on {x,y} whether the society prefers x to y. I prove that if a social welfare function satisfying Unanimity and Independence also satisfies Pairwise Computability, then it is dictatorial. This result severely limits on practical grounds Fishburn's resolution~(1970) of Arrow's impossibility. I also give an interpretation of a denumerable ``society.'' {Keywords} Arrow impossibility theorem, Hayek's knowledge problem, algorithms, recursion theory, ultrafilters.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Mihara, H.R., 1994. "Arrow's Theorem and Turing Computability," Papers 276, Minnesota - Center for Economic Research.
    • Handle: RePEc:fth:minner:276
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. Spear, Stephen E, 1989. "Learning Rational Expectations under Computability Constraints," Econometrica, Econometric Society, vol. 57(4), pages 889-910, July.
    3. Fishburn, Peter C., 1970. "Arrow's impossibility theorem: Concise proof and infinite voters," Journal of Economic Theory, Elsevier, vol. 2(1), pages 103-106, March.
    4. 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.
    5. Kelly, Jerry S., 1988. "Social choice and computational complexity," Journal of Mathematical Economics, Elsevier, vol. 17(1), pages 1-8, February.
    6. Lewis, Alain A., 1988. "An infinite version of arrow's theorem in the effective setting," Mathematical Social Sciences, Elsevier, vol. 16(1), pages 41-48, August.
    7. Arrow, Kenneth J, 1986. "Rationality of Self and Others in an Economic System," The Journal of Business, University of Chicago Press, vol. 59(4), pages 385-399, October.
    8. Hausman, Daniel M & McPherson, Michael S, 1993. "Taking Ethics Seriously: Economics and Contemporary Moral Philosophy," Journal of Economic Literature, American Economic Association, vol. 31(2), pages 671-731, June.
    9. Armstrong, Thomas E., 1980. "Arrow's theorem with restricted coalition algebras," Journal of Mathematical Economics, Elsevier, vol. 7(1), pages 55-75, March.
    10. Armstrong, Thomas E., 1985. "Precisely dictatorial social welfare functions : Erratum and Addendum to `arrows theorem with restricted coalition algebras'," Journal of Mathematical Economics, Elsevier, vol. 14(1), pages 57-59, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    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. 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.
    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. Mihara, H. Reiju, 2004. "Nonanonymity and sensitivity of computable simple games," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 329-341, November.
    5. Bossert, Walter & Cato, Susumu, 2020. "Acyclicity, anonymity, and prefilters," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 134-141.
    6. 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.
    7. Andrei Gomberg & César Martinelli & Ricard Torres, 2005. "Anonymity in large societies," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 25(1), pages 187-205, October.
    8. H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, University Library of Munich, Germany, revised 01 Jun 2004.
    9. Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, University Library of Munich, Germany, revised 01 Jun 2004.
    10. 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.
    11. Mihara, H. Reiju, 2017. "Characterizing the Borda ranking rule for a fixed population," MPRA Paper 78093, University Library of Munich, Germany.
    12. 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.
    13. Grainger, Daniel & Stoeckl, Natalie, 2019. "The importance of social learning for non-market valuation," Ecological Economics, Elsevier, vol. 164(C), pages 1-1.
    14. Susumu Cato, 2020. "Quasi-stationary social welfare functions," Theory and Decision, Springer, vol. 89(1), pages 85-106, July.
    15. 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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, University Library of Munich, Germany, revised 01 Jun 2004.
    2. 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.
    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. 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.
    5. Ricard Torres, 2002. "Smallness of Invisible Dictators," Working Papers 0213, Centro de Investigacion Economica, ITAM, revised Sep 2003.
    6. Andrei Gomberg & César Martinelli & Ricard Torres, 2005. "Anonymity in large societies," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 25(1), pages 187-205, October.
    7. Mihara, H. Reiju, 2004. "Nonanonymity and sensitivity of computable simple games," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 329-341, November.
    8. Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, University Library of Munich, Germany, revised 01 Jun 2004.
    9. Herzberg, Frederik S., 2008. "Judgement aggregation functions and ultraproducts," MPRA Paper 10546, University Library of Munich, Germany, revised 10 Sep 2008.
    10. Cato, Susumu, 2017. "Unanimity, anonymity, and infinite population," Journal of Mathematical Economics, Elsevier, vol. 71(C), pages 28-35.
    11. Susumu Cato, 2022. "Stable preference aggregation with infinite population," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(2), pages 287-304, August.
    12. Torres, Ricard, 2005. "Limiting Dictatorial rules," Journal of Mathematical Economics, Elsevier, vol. 41(7), pages 913-935, November.
    13. Eisermann, Michael, 2006. "Arrovian juntas," MPRA Paper 81, University Library of Munich, Germany, revised 03 Oct 2006.
    14. Cato, Susumu, 2021. "Preference aggregation and atoms in measures," Journal of Mathematical Economics, Elsevier, vol. 94(C).
    15. Lauwers, Luc & Van Liedekerke, Luc, 1995. "Ultraproducts and aggregation," Journal of Mathematical Economics, Elsevier, vol. 24(3), pages 217-237.
    16. Susumu Cato, 2019. "The possibility of Paretian anonymous decision-making with an infinite population," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 53(4), pages 587-601, December.
    17. 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.
    18. Bossert, Walter & Cato, Susumu, 2020. "Acyclicity, anonymity, and prefilters," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 134-141.
    19. 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.
    20. Ying-Fang Kao & Ragupathy Venkatachalam, 2021. "Human and Machine Learning," Computational Economics, Springer;Society for Computational Economics, vol. 57(3), pages 889-909, March.

    More about this item

    Keywords

    social welfare ; economic theory;

    JEL classification:

    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
    • C69 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Other
    • D89 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Other

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:fth:minner:276. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/deumnus.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.