IDEAS home Printed from https://ideas.repec.org/a/spr/advdac/v3y2009i3p291-304.html
   My bibliography  Save this article

On critical sets of a finite Moore family

Author

Listed:
  • Jean Diatta

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:advdac:v:3:y:2009:i:3:p:291-304
    DOI: 10.1007/s11634-009-0053-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11634-009-0053-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11634-009-0053-8?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. Domenach, Florent & Leclerc, Bruno, 2004. "Closure systems, implicational systems, overhanging relations and the case of hierarchical classification," Mathematical Social Sciences, Elsevier, vol. 47(3), pages 349-366, May.
    2. Koshevoy, Gleb A., 1999. "Choice functions and abstract convex geometries," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 35-44, July.
    3. Plott, Charles R, 1973. "Path Independence, Rationality, and Social Choice," Econometrica, Econometric Society, vol. 41(6), pages 1075-1091, November.
    4. Caspard, N. & Monjardet, B., 2000. "The Lattice of Closure Systems, Closure Operators and Implicational Systems on a Finite Set : A Survey," Papiers d'Economie Mathématique et Applications 2000.120, Université Panthéon-Sorbonne (Paris 1).
    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. 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. Samson Alva & Battal Dou{g}an, 2021. "Choice and Market Design," Papers 2110.15446, arXiv.org, revised Nov 2021.
    3. Chambers, Christopher P. & Miller, Alan D. & Yenmez, M. Bumin, 2020. "Closure and preferences," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 161-166.
    4. 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.
    5. Danilov, V. & Koshevoy, G., 2005. "Mathematics of Plott choice functions," Mathematical Social Sciences, Elsevier, vol. 49(3), pages 245-272, May.
    6. Vladimir Danilov & Gleb Koshevoy & Ernesto Savaglio, 2012. "Orderings of Opportunity Sets," Working Papers 282, ECINEQ, Society for the Study of Economic Inequality.
    7. V. Danilov & G. Koshevoy & E. Savaglio, 2015. "Hyper-relations, choice functions, and orderings of opportunity sets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(1), pages 51-69, June.
    8. Bernard Monjardet, 2007. "Some Order Dualities In Logic, Games And Choices," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 9(01), pages 1-12.
    9. Danilov, V., 2012. "Outcast Condition in the Choice Theory," Journal of the New Economic Association, New Economic Association, vol. 13(1), pages 34-49.
    10. 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.
    11. Yang, Yi-You, 2020. "Rationalizable choice functions," Games and Economic Behavior, Elsevier, vol. 123(C), pages 120-126.
    12. 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.
    13. 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.
    14. 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.
    15. Matthew Ryan, 2016. "Essentiality and Convexity in the Ranking of Opportunity Sets," Working Papers 2016-01, Auckland University of Technology, Department of Economics.
    16. repec:ebl:ecbull:v:4:y:2004:i:3:p:1-3 is not listed on IDEAS
    17. 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.
    18. 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.
    19. Alva, Samson, 2018. "WARP and combinatorial choice," Journal of Economic Theory, Elsevier, vol. 173(C), pages 320-333.
    20. 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.
    21. Monjardet, Bernard, 2003. "The presence of lattice theory in discrete problems of mathematical social sciences. Why," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 103-144, October.

    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:spr:advdac:v:3:y:2009:i:3:p:291-304. 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.