IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v225y2015i1p111-12310.1007-s10479-013-1342-3.html
   My bibliography  Save this article

Complexity results for extensions of median orders to different types of remoteness

Author

Listed:
  • Olivier Hudry

Abstract

Given a finite set X and a collection Π=(R 1 ,R 2 ,…,R v ) of v binary relations defined on X and given a remoteness ρ, a relation R is said to be a central relation of Π with respect to ρ if it minimizes the remoteness ρ(Π,R) from Π. The remoteness ρ is based on the symmetric difference distance δ(R i ,R) between R and the binary relations R i of Π (1≤i≤v), which measures the number of disagreements between R i and R. Usually, the considered remoteness between Π and a relation R is the remoteness ρ 1 (Π,R) given by the sum of the distances δ(R i ,R) over i, and thus measures the total number of disagreements between Π and R or, divided by v, provides the (arithmetical) mean number of disagreements between Π and R. The computation of a central relation with respect to ρ 1 is often an NP-hard problem when the central relation is required to fulfill structural properties like transitivity. In this paper, we investigate other types of remoteness ρ, for instance the sum of the pth power of the δ(R i ,R)’s for any integer p, the maximum of the δ(R i ,R)’s, the minimum of the δ(R i ,R)’s, and different kinds of means of the δ(R i ,R)’s, or their weighted versions. We show that for many definitions of the remoteness, including the previous ones, the computation of a central relation with respect to ρ remains an NP-hard problem, even when the number v of relations is given, for any value of v greater than or equal to 1. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:225:y:2015:i:1:p:111-123:10.1007/s10479-013-1342-3
    DOI: 10.1007/s10479-013-1342-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-013-1342-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-013-1342-3?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. 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.
    2. 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.
    3. 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.
    4. Olivier Hudry, 2008. "NP-hardness results for the aggregation of linear orders into median orders," Annals of Operations Research, Springer, vol. 163(1), pages 63-88, October.
    5. Nathalie Caspard & Bruno Leclerc & Bernard Monjardet, 2012. "Finite Ordered Sets Concepts, Results and Uses," Post-Print halshs-00800193, HAL.
    6. Hudry, Olivier, 2012. "On the computation of median linear orders, of median complete preorders and of median weak orders," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 2-10.
    7. 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.
    8. Hudry, Olivier, 2009. "A survey on the complexity of tournament solutions," Mathematical Social Sciences, Elsevier, vol. 57(3), pages 292-303, May.
    9. Denis Bouyssou & Thierry Marchant & Marc Pirlot & Alexis Tsoukiàs & Philippe Vincke, 2006. "Evaluation and Decision Models with Multiple Criteria," International Series in Operations Research and Management Science, Springer, number 978-0-387-31099-2, December.
    10. Hudry, Olivier, 2010. "On the complexity of Slater's problems," European Journal of Operational Research, Elsevier, vol. 203(1), pages 216-221, May.
    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. Hudry, Olivier, 2012. "On the computation of median linear orders, of median complete preorders and of median weak orders," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 2-10.
    2. 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.
    3. 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.
    4. Ernesto Savaglio & Stefano Vannucci, 2022. "Strategy-proof aggregation rules in median semilattices with applications to preference aggregation," Papers 2208.12732, arXiv.org.
    5. Juan Aparicio & Mercedes Landete & Juan F. Monge, 2020. "A linear ordering problem of sets," Annals of Operations Research, Springer, vol. 288(1), pages 45-64, May.
    6. Hudry, Olivier, 2010. "On the complexity of Slater's problems," European Journal of Operational Research, Elsevier, vol. 203(1), pages 216-221, May.
    7. Khannoussi, Arwa & Meyer, Patrick & Chaubet, Aurore, 2023. "A multi-criteria decision aiding approach for upgrading public sewerage systems and its application to the city of Brest," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    8. Paredes-Frigolett, Harold, 2016. "Modeling the effect of responsible research and innovation in quadruple helix innovation systems," Technological Forecasting and Social Change, Elsevier, vol. 110(C), pages 126-133.
    9. 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.
    10. Thomas Demuynck, 2014. "The computational complexity of rationalizing Pareto optimal choice behavior," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 529-549, March.
    11. Hudry, Olivier, 2009. "A survey on the complexity of tournament solutions," Mathematical Social Sciences, Elsevier, vol. 57(3), pages 292-303, May.
    12. Hannu Salonen, 2014. "Aggregating and Updating Information," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 8(2), pages 55-67, October.
    13. Dias, Luis C. & Lamboray, Claude, 2010. "Extensions of the prudence principle to exploit a valued outranking relation," European Journal of Operational Research, Elsevier, vol. 201(3), pages 828-837, March.
    14. Nehring, Klaus & Pivato, Marcus & Puppe, Clemens, 2014. "The Condorcet set: Majority voting over interconnected propositions," Journal of Economic Theory, Elsevier, vol. 151(C), pages 268-303.
    15. Nehring, Klaus & Pivato, Marcus & Puppe, Clemens, 2011. "Condorcet admissibility: Indeterminacy and path-dependence under majority voting on interconnected decisions," MPRA Paper 32434, University Library of Munich, Germany.
    16. Eduardo Fernández & Claudia Gómez-Santillán & Nelson Rangel-Valdez & Laura Cruz-Reyes, 2022. "Group Multi-Objective Optimization Under Imprecision and Uncertainty Using a Novel Interval Outranking Approach," Group Decision and Negotiation, Springer, vol. 31(5), pages 945-994, October.
    17. Vincent Anesi, 2012. "A new old solution for weak tournaments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(4), pages 919-930, October.
    18. Joseph, Rémy-Robert, 2010. "Making choices with a binary relation: Relative choice axioms and transitive closures," European Journal of Operational Research, Elsevier, vol. 207(2), pages 865-877, December.
    19. Marcus Pivato, 2013. "Voting rules as statistical estimators," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(2), pages 581-630, February.
    20. Dewan F. Wahid & Elkafi Hassini, 2022. "A Literature Review on Correlation Clustering: Cross-disciplinary Taxonomy with Bibliometric Analysis," SN Operations Research Forum, Springer, vol. 3(3), pages 1-42, September.

    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:annopr:v:225:y:2015:i:1:p:111-123:10.1007/s10479-013-1342-3. 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.