IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v22y1988i4p278-288.html
   My bibliography  Save this article

Algorithms for Voting and Competitive Location on a Network

Author

Listed:
  • Pierre Hansen

    (RUTCOR, Rutgers University, New Brunswick, New Jersey 08903)

  • Martine Labbé

    (Erasmus Universiteit Rotterdam, Posbus 1738, 3000 DR Rotterdam, The Netherlands, and CORE, 34 voie du Roman Pays, 1348 Louvain-la-Neuve, Belgium)

Abstract

Consider a network with weights associated to its vertices. When a facility must be located through a voting procedure, these weights may be interpreted as the numbers of users located on the vertices. When a facility must be located in a competitive setting, i.e., when a concurrent facility will be located later and will capture all clients closer to it, these weights may be viewed as the purchasing power of the clients. A Condorcet point is any point of the network, i.e., a vertex or a point on an edge, such that the set of vertices closer to any other point has a total weight not larger than the half sum of the weights of all the vertices. A Simpson point is a point of the network which minimizes the largest total weight of the set of vertices closer to another point. Polynomial algorithms are provided to determine the sets of Condorcet and of Simpson points of a network.

Suggested Citation

  • Pierre Hansen & Martine Labbé, 1988. "Algorithms for Voting and Competitive Location on a Network," Transportation Science, INFORMS, vol. 22(4), pages 278-288, November.
    • Handle: RePEc:inm:ortrsc:v:22:y:1988:i:4:p:278-288
    DOI: 10.1287/trsc.22.4.278
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.22.4.278
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.22.4.278?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
    ---><---

    Citations

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


    Cited by:

    1. Abdullah Dasci & Gilbert Laporte, 2005. "A Continuous Model for Multistore Competitive Location," Operations Research, INFORMS, vol. 53(2), pages 263-280, April.
    2. Labbe, Martine & Hakimi, S. Louis, 1989. "Market And Locational Equilibrium For Two Competitors," Econometric Institute Archives 272383, Erasmus University Rotterdam.
    3. Zvi Drezner & Mozart B. C. Menezes, 2016. "The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution," Annals of Operations Research, Springer, vol. 246(1), pages 205-226, November.
    4. Fernández, Elena & Pozo, Miguel A. & Puerto, Justo & Scozzari, Andrea, 2017. "Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 260(3), pages 886-903.
    5. Elena Fernández & Justo Puerto & Antonio Rodríguez-Chía, 2013. "On discrete optimization with ordering," Annals of Operations Research, Springer, vol. 207(1), pages 83-96, August.

    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:inm:ortrsc:v:22:y:1988:i:4:p:278-288. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.