IDEAS home Printed from https://ideas.repec.org/p/ems/eureir/7976.html

The plurality strategy on graphs

Author

Listed:
  • Balakrishnan, K.
  • Changat, M.
  • Mulder, H.M.

Abstract

The Majority Strategy for finding medians of a set of clients on a graph can be relaxed in the following way: if we are at v, then we move to a neighbor w if there are at least as many clients closer to w than to v (thus ignoring the clients at equal distance from v and w). The graphs on which this Plurality Strategy always finds the set of all medians are precisely those for which the set of medians induces always a connected subgraph.

Suggested Citation

  • Balakrishnan, K. & Changat, M. & Mulder, H.M., 2006. "The plurality strategy on graphs," Econometric Institute Research Papers EI 2006-35, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    • Handle: RePEc:ems:eureir:7976
    as

    Download full text from publisher

    File URL: https://repub.eur.nl/pub/7976/ei2006-35.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. A. J. Goldman, 1971. "Optimal Center Location in Simple Networks," Transportation Science, INFORMS, vol. 5(2), pages 212-221, May.
    2. 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.
    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. Balakrishnan, K. & Changat, M. & Mulder, H.M., 2007. "Median computation in graphs using consensus strategies," Econometric Institute Research Papers EI 2007-34, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    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. Balakrishnan, K. & Changat, M. & Mulder, H.M. & Subhamathi, A.R., 2011. "Consensus Strategies for Signed Profiles on Graphs," Econometric Institute Research Papers EI2011-34, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Balakrishnan, K. & Changat, M. & Mulder, H.M., 2007. "Median computation in graphs using consensus strategies," Econometric Institute Research Papers EI 2007-34, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. Esmaeil Afrashteh & Behrooz Alizadeh & Fahimeh Baroughi, 2020. "Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks," Annals of Operations Research, Springer, vol. 289(2), pages 153-172, June.
    4. Saul Amorim & Jean-Pierre Barthélemy & Celso Ribeiro, 1992. "Clustering and clique partitioning: Simulated annealing and tabu search approaches," Journal of Classification, Springer;The Classification Society, vol. 9(1), pages 17-41, January.
    5. Joyendu Bhadury & H. A. Eiselt, 2025. "Location and Price Competition on a Uniform Path with Different Pricing Policies," Networks and Spatial Economics, Springer, vol. 25(2), pages 289-329, June.
    6. Klaus Nehring & Marcus Pivato, 2022. "The median rule in judgement aggregation," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 73(4), pages 1051-1100, June.
    7. Mark S. Daskin, 2008. "What you should know about location modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 283-294, June.
    8. Hudry, Olivier, 2009. "A survey on the complexity of tournament solutions," Mathematical Social Sciences, Elsevier, vol. 57(3), pages 292-303, May.
    9. 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.
    10. McMorris, F.R. & Mulder, H.M. & Ortega, O., 2010. "Axiomatic Characterization of the Mean Function on Trees," Econometric Institute Research Papers EI 2010-07, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    11. Wei Ding & Ke Qiu, 2018. "A quadratic time exact algorithm for continuous connected 2-facility location problem in trees," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1262-1298, November.
    12. 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.
    13. Bernard Monjardet, 2008. ""Mathématique Sociale" and Mathematics. A case study: Condorcet's effect and medians," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00309825, HAL.
    14. Elisabeth Gassner, 2012. "An inverse approach to convex ordered median problems in trees," Journal of Combinatorial Optimization, Springer, vol. 23(2), pages 261-273, February.
    15. Nehring, Klaus & Pivato, Marcus, 2019. "Majority rule in the absence of a majority," Journal of Economic Theory, Elsevier, vol. 183(C), pages 213-257.
    16. Rainer Burkard & Jafar Fathali, 2007. "A polynomial method for the pos/neg weighted 3-median problem on a tree," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(2), pages 229-238, April.
    17. Chunsong Bai & Jun Du, 2024. "The Constrained 2-Maxian Problem on Cycles," Mathematics, MDPI, vol. 12(6), pages 1-9, March.
    18. George L. Vairaktarakis & Panagiotis Kouvelis, 1999. "Incorporation dynamic aspects and uncertainty in 1‐median location problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(2), pages 147-168, March.
    19. 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.
    20. 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.

    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:ems:eureir:7976. 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: RePub The email address of this maintainer does not seem to be valid anymore. Please ask RePub to update the entry or send us the correct address (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.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.