Arrow's Theorem and Turing Computability
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.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.Bibliographic Info
Paper provided by EconWPA in its series Public Economics with number 9408001.Length:
Date of creation: 23 Aug 1994
Date of revision: 23 Aug 1994
Handle: RePEc:wpa:wuwppe:9408001
Note: LaTeX2.09 file; Appeared in Economic Theory 10, 257--276 (1997)
Contact details of provider:
Web page: http://128.118.178.162
Related research
Keywords:Other versions of this item:
- H. Reiju Mihara, 1997. "Arrow's Theorem and Turing computability," Economic Theory, Springer, vol. 10(2), pages 257-276.
- Mihara, H.R., 1994. "Arrow's Theorem and Turing Computability," Papers 276, Minnesota - Center for Economic Research.
- 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
This paper has been announced in the following NEP Reports:
- NEP-ALL-1998-10-02 (All new papers)
- NEP-CDM-1998-10-02 (Collective Decision-Making)
- NEP-PBE-1998-10-02 (Public Economics)
- NEP-PUB-1998-10-02 (Public Finance)
References
References listed on IDEASPlease report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- 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.
- H. Reiju Mihara, 1994.
"Anonymity and Neutrality in Arrow's Theorem with Restricted Coalition Algebras,"
Public Economics
9411001, EconWPA, revised 22 Nov 1994.
- H. Reiju Mihara, 1997. "Anonymity and neutrality in Arrow's Theorem with restricted coalition algebras," Social Choice and Welfare, Springer, vol. 14(4), pages 503-512.
- Spear, Stephen E, 1989. "Learning Rational Expectations under Computability Constraints," Econometrica, Econometric Society, vol. 57(4), pages 889-910, July.
- 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.
- H. Reiju Mihara, 1996.
"Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof,"
Public Economics
9604002, EconWPA, revised 20 Sep 1996.
- H. Reiju Mihara, 2001. "Existence of a coalitionally strategyproof social choice function: A constructive proof," Social Choice and Welfare, Springer, vol. 18(3), pages 543-553.
- 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 S385-99, October.
- 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.
- Kelly, Jerry S., 1988. "Social choice and computational complexity," Journal of Mathematical Economics, Elsevier, vol. 17(1), pages 1-8, February.
- Armstrong, Thomas E., 1980. "Arrow's theorem with restricted coalition algebras," Journal of Mathematical Economics, Elsevier, vol. 7(1), pages 55-75, March.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.Cited by:
- 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, vol. 32(1), pages 67-78, May.
- 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.
- Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Preference aggregation theory without acyclicity: The core without majority dissatisfaction," MPRA Paper 11728, University Library of Munich, Germany.
- H. Reiju Mihara, 2003.
"Nonanonymity and sensitivity of computable simple games,"
Game Theory and Information
0310006, EconWPA, revised 01 Jun 2004.
- Mihara, H. Reiju, 2004. "Nonanonymity and sensitivity of computable simple games," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 329-341, November.
- 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.
- 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.
- Andrei Gomberg & Cesar Martinelli & Ricard Torres, 2002.
"Anonymity in Large Societies,"
Working Papers
0211, Centro de Investigacion Economica, ITAM.
- Andrei Gomberg & César Martinelli & Ricard Torres, 2005. "Anonymity in large societies," Social Choice and Welfare, Springer, vol. 25(1), pages 187-205, October.
- Masahiro Kumabe & H. Reiju Mihara, 2008.
"The Nakamura numbers for computable simple games,"
Social Choice and Welfare,
Springer, vol. 31(4), pages 621-640, December.
- Kumabe, Masahiro & Mihara, H. Reiju, 2007. "The Nakamura numbers for computable simple games," MPRA Paper 3684, University Library of Munich, Germany.
- Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, EconWPA, revised 01 Jun 2004.
- H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 07 May 1997.
- Hannu Salonen & Kari Saukkonen, 2005. "On continuity of Arrovian social welfare functions," Social Choice and Welfare, Springer, vol. 25(1), pages 85-93, October.
Lists
This item is featured on the following reading lists or Wikipedia pages:- Filtro (matematica) in Wikipedia (Italian)
Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwppe:9408001For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

