IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v30y2007i1p57-63.html
   My bibliography  Save this article

Proving Arrow’s theorem by PROLOG

Author

Listed:
  • Kenryo Indo

Abstract

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

Suggested Citation

  • Kenryo Indo, 2007. "Proving Arrow’s theorem by PROLOG," Computational Economics, Springer;Society for Computational Economics, vol. 30(1), pages 57-63, August.
    • Handle: RePEc:kap:compec:v:30:y:2007:i:1:p:57-63
    DOI: 10.1007/s10614-007-9086-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10614-007-9086-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10614-007-9086-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Nisan, Noam & Ronen, Amir, 2001. "Algorithmic Mechanism Design," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 166-196, April.
    2. Wilson, Robert, 1972. "Social choice theory without the Pareto Principle," Journal of Economic Theory, Elsevier, vol. 5(3), pages 478-486, December.
    Full references (including those not matched with items on IDEAS)

    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. Marc Fleurbaey, 2000. "Choix social : une difficulté et de multiples possibilités," Revue Économique, Programme National Persée, vol. 51(5), pages 1215-1232.
    2. Juan Candeal, 2013. "Invariance axioms for preferences: applications to social choice theory," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(3), pages 453-471, September.
    3. Xiayan Cheng & Rongheng Li & Yunxia Zhou, 0. "Tighter price of anarchy for selfish task allocation on selfish machines," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-32.
    4. Hervé Crès & Itzhak Gilboa, & Nicolas Vieille, 2012. "Bureaucracy in Quest for Feasibility," Working Papers hal-00973094, HAL.
    5. Lauwers, Luc, 2000. "Topological social choice," Mathematical Social Sciences, Elsevier, vol. 40(1), pages 1-39, July.
    6. Elchanan Mossel & Omer Tamuz, 2012. "Complete characterization of functions satisfying the conditions of Arrow’s theorem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(1), pages 127-140, June.
    7. Miller, Michael K., 2009. "Social choice theory without Pareto: The pivotal voter approach," Mathematical Social Sciences, Elsevier, vol. 58(2), pages 251-255, September.
    8. Levin, Hagay & Schapira, Michael & Zohar, Aviv, 2006. "The Strategic Justification for BGP," MPRA Paper 2110, University Library of Munich, Germany.
    9. Shahar Dobzinski & Noam Nisan & Michael Schapira, 2005. "Truthful Randomized Mechanisms for Combinatorial Auctions," Discussion Paper Series dp408, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    10. Jérémy Picot, 2012. "Random aggregation without the Pareto principle," Review of Economic Design, Springer;Society for Economic Design, vol. 16(1), pages 1-13, March.
    11. Aziz, Haris & Chan, Hau & Lee, Barton E. & Parkes, David C., 2020. "The capacity constrained facility location problem," Games and Economic Behavior, Elsevier, vol. 124(C), pages 478-490.
    12. Rachel R. Chen & Robin O. Roundy & Rachel Q. Zhang & Ganesh Janakiraman, 2005. "Efficient Auction Mechanisms for Supply Chain Procurement," Management Science, INFORMS, vol. 51(3), pages 467-482, March.
    13. Yasuhito Tanaka, 2005. "A topological approach to the Arrow impossibility theorem when individual preferences are weak orders (forcoming in ``Applied Mathematics and Compuation''(Elsevier))," Public Economics 0506013, University Library of Munich, Germany, revised 17 Jun 2005.
    14. Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2012. "A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 823-843, September.
    15. Lars Ehlers & John A. Weymark, 2003. "Candidate stability and nonbinary social choice," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 22(2), pages 233-243, September.
    16. Yuval Emek & Michal Feldman, 2007. "Computing an Optimal Contract in Simple Technologies," Discussion Paper Series dp452, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    17. Jeffrey Richelson, 1984. "Social choice and the status quo," Public Choice, Springer, vol. 42(3), pages 225-234, January.
    18. Susumu Cato, 2016. "Weak independence and the Pareto principle," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(2), pages 295-314, August.
    19. Parikshit De & Manipushpak Mitra, 2017. "Incentives and justice for sequencing problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 64(2), pages 239-264, August.
    20. Kruger, Justin & Sanver, M. Remzi, 2021. "The relationship between Arrow’s and Wilson’s theorems on restricted domains," Mathematical Social Sciences, Elsevier, vol. 114(C), pages 95-97.

    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:kap:compec:v:30:y:2007:i:1:p:57-63. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.