Proving Arrow’s theorem by PROLOG
This paper presented a simple PROLOG implementation for Arrow’s Social welfare function (SWF). Arrow (Social choice and individual values, Yale University Press, 1963) proved that any SWF which satisfies a set of conditions IIA, Pareto, and unrestricted domain should be dictatorial. The PROLOG program can prove the theorem for 3-alternative 2-agent case. With a minor modification it proves a version of the theorem without the Pareto condition by Wilson (Journal of Economic Theory, 5, 478–486, 1972). Copyright Springer Science+Business Media, LLC 2007
Volume (Year): 30 (2007)
Issue (Month): 1 (August)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=100248|
More information through EDIRC
References listed on IDEAS
Please 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.:
- Nisan, Noam & Ronen, Amir, 2001. "Algorithmic Mechanism Design," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 166-196, April.
- Wilson, Robert, 1972. "Social choice theory without the Pareto Principle," Journal of Economic Theory, Elsevier, vol. 5(3), pages 478-486, December.
When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:30:y:2007:i:1:p:57-63. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.