IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v46y2003i2p103-144.html
   My bibliography  Save this article

The presence of lattice theory in discrete problems of mathematical social sciences. Why

Author

Listed:
  • Monjardet, Bernard

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:matsoc:v:46:y:2003:i:2:p:103-144
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(03)00072-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Duquenne, V., 1986. "What can lattices do for experimental designs?," Mathematical Social Sciences, Elsevier, vol. 11(3), pages 243-281, June.
    2. 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.
    3. Crown, Gary D. & Janowitz, Melvin F. & Powers, Robert C., 1993. "Neutral consensus functions," Mathematical Social Sciences, Elsevier, vol. 25(3), pages 231-250, May.
    4. Ahmet Alkan, 2001. "original papers : On preferences over subsets and the lattice structure of stable matchings," Review of Economic Design, Springer;Society for Economic Design, vol. 6(1), pages 99-111.
    5. Gilboa, Itzhak & Lehrer, Ehud, 1991. "Global Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(2), pages 129-147.
    6. Koshevoy, Gleb A., 1999. "Choice functions and abstract convex geometries," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 35-44, July.
    7. Bernard Monjardet & Vololonirina Raderanirina, 2004. "Lattices of choice functions and consensus problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 23(3), pages 349-382, December.
    8. Pierre Barthelemy, Jean & Monjardet, Bernard, 1981. "The median procedure in cluster analysis and social choice theory," Mathematical Social Sciences, Elsevier, vol. 1(3), pages 235-267, May.
    9. Edward Adams, 1986. "N-trees as nestings: Complexity, similarity, and consensus," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 299-317, September.
    10. Tamás Fleiner, 2003. "A Fixed-Point Approach to Stable Matchings and Some Applications," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 103-126, February.
    11. Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(3), pages 249-266.
    12. 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)

    Citations

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


    Cited by:

    1. Michel Grabisch & Agnieszka Rusinowska, 2015. "Lattices in Social Networks with Influence," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 17(01), pages 1-18.
    2. 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.
    3. Ulrich Faigle & Michel Grabisch & Andres Jiménez-Losada & Manuel Ordóñez, 2014. "Games on concept lattices: Shapley value and core," Documents de travail du Centre d'Economie de la Sorbonne 14070, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    4. Thierry Denœux & Marie-Hélène Masson, 2012. "Evidential reasoning in large partially ordered sets," Annals of Operations Research, Springer, vol. 195(1), pages 135-161, May.
    5. John Martin, 2014. "Spatial processes and Galois/concept lattices," Quality & Quantity: International Journal of Methodology, Springer, vol. 48(2), pages 961-981, March.
    6. John Levi Martin, 2016. "The dimensionality of discrete factor analyses," Quality & Quantity: International Journal of Methodology, Springer, vol. 50(6), pages 2451-2467, November.

    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. Danilov, V. & Koshevoy, G., 2005. "Mathematics of Plott choice functions," Mathematical Social Sciences, Elsevier, vol. 49(3), pages 245-272, May.
    2. 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.
    3. Bernard Monjardet & Vololonirina Raderanirina, 2004. "Lattices of choice functions and consensus problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 23(3), pages 349-382, December.
    4. Olivier Hudry & Bernard Monjardet, 2010. "Consensus theories: An oriented survey," Documents de travail du Centre d'Economie de la Sorbonne 10057, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    5. Paula Jaramillo & Çaǧatay Kayı & Flip Klijn, 2014. "On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(4), pages 793-811, April.
    6. Bernard Monjardet & Jean-Pierre Barthélemy & Olivier Hudry & Bruno Leclerc, 2009. "Metric and latticial medians," Post-Print halshs-00408174, HAL.
    7. Derks, Jean & Peters, Hans, 1997. "Consistent restricted Shapley values," Mathematical Social Sciences, Elsevier, vol. 33(1), pages 75-91, February.
    8. Michel Grabisch & Fabien Lange, 2007. "Games on lattices, multichoice games and the shapley value: a new approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(1), pages 153-167, February.
    9. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    10. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    11. Ernesto Savaglio & Stefano Vannucci, 2021. "Strategy-Proof Aggregation Rules in Median Semilattices with Applications to Preference Aggregation," Department of Economics University of Siena 867, Department of Economics, University of Siena.
    12. Vladimir Danilov & Gleb Koshevoy & Ernesto Savaglio, 2012. "Orderings of Opportunity Sets," Working Papers 282, ECINEQ, Society for the Study of Economic Inequality.
    13. Michel Grabisch, 2006. "Capacities and Games on Lattices: A Survey of Result," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00179830, HAL.
    14. Olivier Hudry & Bruno Leclerc & Bernard Monjardet & Jean-Pierre Barthélemy, 2004. "Médianes métriques et latticielles," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03322636, HAL.
    15. Gabriela Bordalo & Nathalie Caspard & Bernard Monjardet, 2009. "Going down in (semi)lattices of finite Moore families and convex geometries," Post-Print halshs-00308785, HAL.
    16. Kamada, Yuichiro & Kojima, Fuhito, 2018. "Stability and strategy-proofness for matching with constraints: a necessary and sufficient condition," Theoretical Economics, Econometric Society, vol. 13(2), May.
    17. Danilov, V., 2012. "Outcast Condition in the Choice Theory," Journal of the New Economic Association, New Economic Association, vol. 13(1), pages 34-49.
    18. 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.
    19. Yang, Yi-You, 2020. "Rationalizable choice functions," Games and Economic Behavior, Elsevier, vol. 123(C), pages 120-126.
    20. Jiao, Zhenhua & Tian, Guoqiang & Chen, Songqing & Yang, Fei, 2016. "The blocking lemma and group incentive compatibility for matching with contracts," Mathematical Social Sciences, Elsevier, vol. 82(C), pages 65-71.

    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:eee:matsoc:v:46:y:2003:i:2:p:103-144. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.