IDEAS home Printed from https://ideas.repec.org/p/hal/cesptp/halshs-00408174.html

Metric and latticial medians

Author

Listed:
  • Bernard Monjardet

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Jean-Pierre Barthélemy

    (LUSSI - Département Logique des Usages, Sciences sociales et Sciences de l'Information - UEB - Université européenne de Bretagne - European University of Brittany - Télécom Bretagne - IMT - Institut Mines-Télécom [Paris])

  • Olivier Hudry

    (TSP - INF - Département Informatique - TSP - Télécom SudParis - IMT - Institut Mines-Télécom [Paris] - IP Paris - Institut Polytechnique de Paris)

  • Bruno Leclerc

    (CAMS - Centre d'Analyse et de Mathématique sociales - EHESS - École des hautes études en sciences sociales - CNRS - Centre National de la Recherche Scientifique)

Abstract

This paper presents the -linked- notions of metric and latticial medians and it explains what is the median procedure for the consensus problems, in particular in the case of the aggregation of linear orders. First we consider the medians of a v-tuple of arbitrary or particular binary relations.. Then we study in depth the difficult (in fact NP-difficult) problem of finding the median orders of a profile of linear orders. More generally, we consider the medians of v-tuples of elements of a semilattice and we describe the median semilattices, i.e. the semilattices were medians are easily computable.

Suggested Citation

  • Bernard Monjardet & Jean-Pierre Barthélemy & Olivier Hudry & Bruno Leclerc, 2009. "Metric and latticial medians," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00408174, HAL.
  • Handle: RePEc:hal:cesptp:halshs-00408174
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00408174v1
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00408174v1/document
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

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


    Cited by:

    1. Irène Charon & Olivier Hudry, 2010. "An updated survey on the linear ordering problem for weighted or unweighted tournaments," Annals of Operations Research, Springer, vol. 175(1), pages 107-158, March.
    2. Olivier Hudry, 2015. "Complexity results for extensions of median orders to different types of remoteness," Annals of Operations Research, Springer, vol. 225(1), pages 111-123, February.
    3. Daniel Eckert & Bernard Monjardet, 2009. "Guilbaud's Theorem : An early contribution to judgment aggregation," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00404185, HAL.
    4. Ernesto Savaglio & Stefano Vannucci, 2022. "Strategy-proof aggregation rules in median semilattices with applications to preference aggregation," Papers 2208.12732, arXiv.org.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    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:hal:cesptp:halshs-00408174. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.