Proving Arrow’s theorem by <Emphasis Type="SmallCaps">PROLOG
This paper presented a simple <Emphasis Type="SmallCaps">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 <Emphasis Type="SmallCaps">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
Year of publication: |
2007
|
---|---|
Authors: | Indo, Kenryo |
Published in: |
Computational Economics. - Society for Computational Economics - SCE, ISSN 0927-7099. - Vol. 30.2007, 1, p. 57-63
|
Publisher: |
Society for Computational Economics - SCE |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Proving Arrow’s theorem by PROLOG
Indo, Kenryo, (2007)
-
Indo, Kenryo, (2011)
-
Proving Arrow's theorem by PROLOG
Indo, Kenryo, (2007)
- More ...