Algorithms for Voting and Competitive Location on a Network

Pierre Hansen and Martine Labbé
Additional contact information
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

Transportation Science, 1988, vol. 22, issue 4, 278-288

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.

Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.22.4.278 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:22:y:1988:i:4:p:278-288

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().