Outcomes of voting and planning in single facility location problems
Consider the problem of finding a single facility on a network on which a given number of users are located. If a voting procedure is used, the optimal solution is a point, called a Condorcet point, such that no other is closer to an absolute majority of users. If a planning procedure is used, the optimal solution is a median which minimizes the sum of all distances to the users. The author first shows that the solutions of the two procedures coincide if the given network is a cactus. Then a polynomial algorithm is given to find the set of Condorcet points for a cactus. Finally, the outcomes of the two procedures are compared in terms of the cyclic structure and the number of users in the network.
- Equivalence of Solutions to Network Location Problems
- scientific article; zbMATH DE number 3835729 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Networks with Condorcet solutions
- New perspectives in competitive location theory
- On locating new facilities in a competitive environment
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- A comparison of formulations and solution methods for the minimum-envy location problem
- Networks with Condorcet solutions
- How bad can a voting locating be
- Distance weighted voting and a single facility location problem
- Some personal views on the current state and the future of locational analysis
- Relaxation of the Condorcet and Simpson conditions in voting location
- Outcomes of bargaining and planning in single facility location problems
- Competitive location on a network
- scientific article; zbMATH DE number 4199949 (Why is no real title available?)
- Comparison of Condorcet and Weber solutions on a plane: social choice versus centralization
- Condorcet winner configurations of linear networks
- Sequential competitive location on networks
- On condorcet and median points of simple rectilinear polygons
- Conditional Location Problems on Networks and in the Plane
- Comparison of \(\alpha\)-Condorcet points with median and center locations
- The discrete facility location problem with balanced allocation of customers
- Multiple voting location and single voting location on trees
- Multiple voting location problems
This page was built for publication: Outcomes of voting and planning in single facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060128)
