scientific article; zbMATH DE number 4199949

zbMATH Open0726.90040MaRDI QIDQ3348690FDOQ3348690

Authors: Pierre Hansen, Jacques-François Thisse, Richard E. Wendell 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• Equivalence of Solutions to Network Location Problems
• Algorithms for Voting and Competitive Location on a Network
• How bad can a voting locating be
• Outcomes of voting and planning in single facility location problems
• Multiple voting location and single voting location on trees

zbMATH Keywords

surveyNash equilibriumlocation on networksmultiple facilitiesmultiple decision makersvoting processes

Mathematics Subject Classification ID

Voting theory (91B12) Discrete location and assignment (90B80)

Cited In (13)

• Competitive location on a network
• Algorithms for Voting and Competitive Location on a Network
• On condorcet and median points of simple rectilinear polygons
• Sequential competitive location on networks
• Relaxed voting and competitive location under monotonous gain functions on trees
• Static competitive facility location: an overview of optimisation approaches.
• Some personal views on the current state and the future of locational analysis
• Technical note: The competitive facility location problem in a duopoly: advances beyond trees
• Multiple voting location problems
• Word of Mouth: Rumor Dissemination in Social Networks
• How bad can a voting locating be
• The \((1 | 1)\)-centroid problem in the plane with distance constraints
• Location of an obnoxious facility on a network: A voting approach

This page was built for publication:

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