Algorithms for Voting and Competitive Location on a Network
From MaRDI portal
Publication:3818091
DOI10.1287/trsc.22.4.278zbMath0665.90024OpenAlexW2039989930MaRDI QIDQ3818091
Publication date: 1988
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.22.4.278
networkPolynomial algorithmsfacility locationCondorcet pointvoting procedureSimpson pointcompetitive setting
Related Items (21)
How bad can a voting locating be ⋮ Competitive location on a network ⋮ Improved algorithms for some competitive location centroid problems on paths, trees and graphs ⋮ On condorcet and median points of simple rectilinear polygons ⋮ Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations ⋮ \((r|p)\)-centroid problems on networks with vertex and edge demand ⋮ On discrete optimization with ordering ⋮ An exact method for the discrete \((r|p)\)-centroid problem ⋮ Sequential competitive location on networks ⋮ The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ Condorcet winner configurations of linear networks ⋮ Relaxed voting and competitive location under monotonous gain functions on trees ⋮ On competitive sequential location in a network with a decreasing demand intensity ⋮ A competitive facility location problem on a tree network with stochastic weights. ⋮ Sequential location problems ⋮ \((r,p)\)-centroid problems on paths and trees ⋮ Perception and information in a competitive location model ⋮ An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon ⋮ Conditional Location Problems on Networks and in the Plane ⋮ Relaxation of the Condorcet and Simpson conditions in voting location
This page was built for publication: Algorithms for Voting and Competitive Location on a Network
