Relaxed voting and competitive location under monotonous gain functions on trees

DOI10.1016/J.DAM.2009.05.006zbMath1225.05233OpenAlexW1964688335MaRDI QIDQ968153

Hans-Christoph Wirth, Joachim Spoerhase

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.05.006

zbMATH Keywords

treesefficient algorithmscompetitive locationvoting location

Mathematics Subject Classification ID

Trees (05C05) Hierarchical games (including Stackelberg games) (91A65) Graph algorithms (graph-theoretic aspects) (05C85) Social choice (91B14) Spatial models in economics (91B72)

Related Items (3)

Sequential competitive location on networks ⋮ \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario ⋮ Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple voting location and single voting location on trees
• Multiple voting location problems
• Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
• Time bounds for selection
• All Stackelberg location equilibria in the Hotelling's duopoly model on a tree with parametric prices
• Relaxation of the Condorcet and Simpson conditions in voting location
• Algorithms for Voting and Competitive Location on a Network

This page was built for publication: Relaxed voting and competitive location under monotonous gain functions on trees