Distance weighted voting and a single facility location problem

DOI10.1016/0377-2217(89)90252-XMaRDI QIDQ1120459zbMATH OpenOpenAlexFDO

Authors Rakesh V. Vohra

Publication date 1989

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(89)90252-x

zbMATH Keywords

votingpolynomial algorithmCondorcet point of a networkfacility loationnonlinear location

Mathematics Subject Classification ID

Social choice (91B14) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Recommendations

• Algorithms for Voting and Competitive Location on a Network
• How bad can a voting locating be
• Location of an obnoxious facility on a network: A voting approach
• Outcomes of voting and planning in single facility location problems
• The tolerant Condorcet points

Cites work

• Networks with Condorcet solutions
• Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network

Cited in

(11)

• Algorithms for Voting and Competitive Location on a Network
• An axiomatic characterization of some locations in trees
• Comparison of Condorcet and Weber solutions on a plane: social choice versus centralization
• The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution
• Multiple voting location problems
• Relaxation of the Condorcet and Simpson conditions in voting location
• Networks with Condorcet solutions
• Outcomes of voting and planning in single facility location problems
• How bad can a voting locating be
• The tolerant Condorcet points
• Location of an obnoxious facility on a network: A voting approach

This page was built for publication: Distance weighted voting and a single facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120459)