Arrow's theorem, countably many agents, and more visible invisible dictators1
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- Barton L. Lipman, 1995.
"Information Processing and Bounded Rationality: A Survey,"
Canadian Journal of Economics, Canadian Economics Association, vol. 28(1), pages 42-67, February.
- Barton L. Lipman, 1993. "Information Processing and Bounded Rationality: A Survey," Working Paper 872, Economics Department, Queen's University.
- Luca Anderlini & Leonardo Felli, 1994.
"Incomplete Written Contracts: Undescribable States of Nature,"
The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 109(4), pages 1085-1124.
- Anderlini, L. & Felli, L., 1993. "Incomplete Written Contracts: Undescribable States of Nature," Papers 183, Cambridge - Risk, Information & Quantity Signals.
- Canning, David, 1992. "Rationality, Computability, and Nash Equilibrium," Econometrica, Econometric Society, vol. 60(4), pages 877-888, July.
- 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.
- 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, 1997.
"Arrow's Theorem and Turing computability,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 10(2), pages 257-276.
- H. Reiju Mihara, 1994. "Arrow's Theorem and Turing Computability," Public Economics 9408001, University Library of Munich, Germany, revised 06 Aug 1998.
- Mihara, H.R., 1994. "Arrow's Theorem and Turing Computability," Papers 276, Minnesota - Center for Economic Research.
- Kirman, Alan P. & Sondermann, Dieter, 1972.
"Arrow's theorem, many agents, and invisible dictators,"
Journal of Economic Theory, Elsevier, vol. 5(2), pages 267-277, October.
- KIRMAN, Alan P. & SONDERMANN, Dieter, 1972. "Arrow's theorem, many agents, and indivisible dictators," LIDAM Reprints CORE 118, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Elisha A. Pazner & Eugene Wesley, 1978. "Cheatproofness Properties of the Plurality Rule in Large Societies," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 45(1), pages 85-91.
- 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.
- H. Reiju Mihara, 1996. "Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof," Public Economics 9604002, University Library of Munich, Germany, revised 01 Jun 2004.
- Lauwers, Luc & Van Liedekerke, Luc, 1995. "Ultraproducts and aggregation," Journal of Mathematical Economics, Elsevier, vol. 24(3), pages 217-237.
- 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:
- Mihara, H. Reiju, 2004.
"Nonanonymity and sensitivity of computable simple games,"
Mathematical Social Sciences, Elsevier, vol. 48(3), pages 329-341, November.
- H. Reiju Mihara, 2003. "Nonanonymity and sensitivity of computable simple games," Game Theory and Information 0310006, University Library of Munich, Germany, revised 01 Jun 2004.
- 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.
- 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.
- 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.
- 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.
- Andrei Gomberg & Cesar Martinelli & Ricard Torres, 2002. "Anonymity in Large Societies," Working Papers 0211, Centro de Investigacion Economica, ITAM.
- 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.
- H. Reiju Mihara, 1996. "Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof," Public Economics 9604002, University Library of Munich, Germany, revised 01 Jun 2004.
- Ricard Torres, 2002. "Smallness of Invisible Dictators," Working Papers 0213, Centro de Investigacion Economica, ITAM, revised Sep 2003.
- Potgieter, Petrus H. & Rosinger, Elemér E., 2007. "Is Economics Entering its Post-Witchcraft Era?," MPRA Paper 3340, University Library of Munich, Germany.
- Uuganbaatar Ninjbat, 2018. "Impossibility theorems with countably many individuals," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 9(3), pages 333-350, August.
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.- 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.
- 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.
- 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.
- 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.
- H. Reiju Mihara, 1994. "Arrow's Theorem and Turing Computability," Public Economics 9408001, University Library of Munich, Germany, revised 06 Aug 1998.
- Mihara, H.R., 1994. "Arrow's Theorem and Turing Computability," Papers 276, Minnesota - Center for Economic Research.
- Bossert, Walter & Cato, Susumu, 2020. "Acyclicity, anonymity, and prefilters," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 134-141.
- 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.
- Herzberg, Frederik S., 2008.
"Judgement aggregation functions and ultraproducts,"
MPRA Paper
10546, University Library of Munich, Germany, revised 10 Sep 2008.
- Herzberg, Frederik, 2011. "Judgment aggregation functions and ultraproducts," Center for Mathematical Economics Working Papers 405, Center for Mathematical Economics, Bielefeld University.
- 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.
- Andrei Gomberg & Cesar Martinelli & Ricard Torres, 2002. "Anonymity in Large Societies," Working Papers 0211, Centro de Investigacion Economica, ITAM.
- Mihara, H. Reiju, 2004.
"Nonanonymity and sensitivity of computable simple games,"
Mathematical Social Sciences, Elsevier, vol. 48(3), pages 329-341, November.
- H. Reiju Mihara, 2003. "Nonanonymity and sensitivity of computable simple games," Game Theory and Information 0310006, University Library of Munich, Germany, revised 01 Jun 2004.
- 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.
- 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.
- 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.
- Cato, Susumu, 2017. "Unanimity, anonymity, and infinite population," Journal of Mathematical Economics, Elsevier, vol. 71(C), pages 28-35.
- Eisermann, Michael, 2006. "Arrovian juntas," MPRA Paper 81, University Library of Munich, Germany, revised 03 Oct 2006.
- Cato, Susumu, 2021. "Preference aggregation and atoms in measures," Journal of Mathematical Economics, Elsevier, vol. 94(C).
- Lauwers, Luc & Van Liedekerke, Luc, 1995. "Ultraproducts and aggregation," Journal of Mathematical Economics, Elsevier, vol. 24(3), pages 217-237.
- 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.
- 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.
- Kumabe, Masahiro & Mihara, H. Reiju, 2007. "The Nakamura numbers for computable simple games," MPRA Paper 3684, University Library of Munich, Germany.
- Herzberg, Frederik & Eckert, Daniel, 2012. "The model-theoretic approach to aggregation: Impossibility results for finite and infinite electorates," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 41-47.
- Pivato, Marcus, 2008. "Sustainable preferences via nondiscounted, hyperreal intergenerational welfare functions," MPRA Paper 7461, University Library of Munich, Germany.
- Anderlini, Luca, 1998. "Forecasting errors and bounded rationality: An example," Mathematical Social Sciences, Elsevier, vol. 36(2), pages 71-90, September.
- Frederik S. Herzberg, 2013. "The (im)possibility of collective risk measurement: Arrovian aggregation of variational preferences," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 1(1), pages 69-92, May.
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:eee:mateco:v:32:y:1999:i:3:p:267-287. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.