IDEAS home Printed from https://ideas.repec.org/p/ecm/wc2000/0622.html
   My bibliography  Save this paper

Locally Complete Path Independent Choice Functions and Their Lattices

Author

Listed:
  • Richard A. Dean

    (California Institute of Technology)

  • Mark R. Johnson

    (Tulane University)

Abstract

The concept of path independence (PI) was first introduced by Arrow (1963) as a defense of his requirement that collective choices be rationalized by a weak ordering. Plott (1973) highlighted the dynamic aspects of PI implicit in Arrow's initial discussion. Throughout these investigations two questions, both initially raised by Plott, remained unanswered. What are the precise mathematical foundations for path independence? How can PI choice functions be constructed? We give complete answers to both these questions for finite domains and provide necessary conditions for infinite domains. We introduce a lattice associated with each PI function. For finite domains these lattices coincide with locally lower distributive or meet-distributive lattices and uniquely characterize PI functions. We also present an algorithm, effective and exhaustive for finite domains, for the construction of PI choice functions and hence for all finite locally lower distributive lattices. For finite domains, a PI function is rationalizable if and only if the lattice is distributive. The lattices associated with PI functions that satisfy the stronger condition of the weak axiom of revealed preference are chains of Boolean algebras and conversely. Those that satisfy the strong axiom of revealed preference are chains and conversely.

Suggested Citation

  • Richard A. Dean & Mark R. Johnson, 2000. "Locally Complete Path Independent Choice Functions and Their Lattices," Econometric Society World Congress 2000 Contributed Papers 0622, Econometric Society.
    • Handle: RePEc:ecm:wc2000:0622
    as

    Download full text from publisher

    File URL: http://fmwww.bc.edu/RePEc/es2000/0622.pdf
    File Function: main text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Johnson Mark R., 1995. "Ideal Structures of Path Independent Choice Functions," Journal of Economic Theory, Elsevier, vol. 65(2), pages 468-504, April.
    2. Kelly, Jerry S., 1984. "The Sertel and Van der Bellen problems," Mathematical Social Sciences, Elsevier, vol. 8(3), pages 287-290, December.
    3. Koshevoy, Gleb A., 1999. "Choice functions and abstract convex geometries," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 35-44, July.
    4. Johnson, Mark R., 1990. "Information, associativity, and choice requirements," Journal of Economic Theory, Elsevier, vol. 52(2), pages 440-452, December.
    5. Sertel, Murat R & Van der Bellen, Alexander, 1979. "Synopses in the Theory of Choice," Econometrica, Econometric Society, vol. 47(6), pages 1367-1389, November.
    6. Plott, Charles R, 1973. "Path Independence, Rationality, and Social Choice," Econometrica, Econometric Society, vol. 41(6), pages 1075-1091, November.
    7. Malishevski, Andrey V., 1994. "Path independence in serial--parallel data processing," Mathematical Social Sciences, Elsevier, vol. 27(3), pages 335-367, June.
    8. Sertel, Murat R., 1988. "Characterizing fidelity for reflexive choices," Mathematical Social Sciences, Elsevier, vol. 15(1), pages 93-95, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Monjardet, Bernard & Raderanirina, Vololonirina, 2001. "The duality between the anti-exchange closure operators and the path independent choice operators on a finite set," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 131-150, March.
    2. Alva, Samson, 2018. "WARP and combinatorial choice," Journal of Economic Theory, Elsevier, vol. 173(C), pages 320-333.

    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. Johnson, Mark R. & Dean, Richard A., 2001. "Locally complete path independent choice functions and their lattices," Mathematical Social Sciences, Elsevier, vol. 42(1), pages 53-87, July.
    2. Apesteguia, Jose & Ballester, Miguel A., 2010. "The Computational Complexity of Rationalizing Behavior," Journal of Mathematical Economics, Elsevier, vol. 46(3), pages 356-363, May.
    3. Danilov, V., 2012. "Outcast Condition in the Choice Theory," Journal of the New Economic Association, New Economic Association, vol. 13(1), pages 34-49.
    4. Klaus Nehring & Selva Demiralp & Clemens Puppe, 2003. "Extended Partial Orders: A Unifying Structure For Abstract Choice Theory," Working Papers 91, University of California, Davis, Department of Economics.
    5. Mark Johnson & Richard Dean, "undated". "Designer Path Independent Choice Functions," Working Papers 2145927, Department of Economics, W. P. Carey School of Business, Arizona State University.
    6. Chambers, Christopher P. & Miller, Alan D. & Yenmez, M. Bumin, 2020. "Closure and preferences," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 161-166.
    7. Domenico Cantone & Alfio Giarlotta & Stephen Watson, 2021. "Choice resolutions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 56(4), pages 713-753, May.
    8. Monjardet, Bernard & Raderanirina, Vololonirina, 2001. "The duality between the anti-exchange closure operators and the path independent choice operators on a finite set," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 131-150, March.
    9. repec:ebl:ecbull:v:4:y:2004:i:3:p:1-3 is not listed on IDEAS
    10. Asan, Goksel & Sanver, M. Remzi, 2002. "Another characterization of the majority rule," Economics Letters, Elsevier, vol. 75(3), pages 409-413, May.
    11. Alva, Samson, 2018. "WARP and combinatorial choice," Journal of Economic Theory, Elsevier, vol. 173(C), pages 320-333.
    12. Samson Alva & Battal Dou{g}an, 2021. "Choice and Market Design," Papers 2110.15446, arXiv.org, revised Nov 2021.
    13. Danilov, V. & Koshevoy, G., 2005. "Mathematics of Plott choice functions," Mathematical Social Sciences, Elsevier, vol. 49(3), pages 245-272, May.
    14. Danilov, V. & Koshevoy, G., 2006. "A new characterization of the path independent choice functions," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 238-245, March.
    15. Yang, Yi-You, 2020. "Rationalizable choice functions," Games and Economic Behavior, Elsevier, vol. 123(C), pages 120-126.
    16. Matthew Ryan, 2016. "Essentiality and convexity in the ranking of opportunity sets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(4), pages 853-877, December.
    17. Bandyopadhyay, Taradas & Sengupta, Kunal, 1999. "The Congruence Axiom and Path Independence," Journal of Economic Theory, Elsevier, vol. 87(1), pages 254-266, July.
    18. Matthew Ryan, 2010. "Mixture sets on finite domains," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 33(2), pages 139-147, November.
    19. Jean Diatta, 2009. "On critical sets of a finite Moore family," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 3(3), pages 291-304, December.
    20. Matthew Ryan, 2016. "Essentiality and Convexity in the Ranking of Opportunity Sets," Working Papers 2016-01, Auckland University of Technology, Department of Economics.
    21. Matthew Ryan, 2014. "Path independent choice and the ranking of opportunity sets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(1), pages 193-213, January.

    More about this item

    Statistics

    Access and download statistics

    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:ecm:wc2000:0622. 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: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/essssea.html .

    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.