Relaxed voting and competitive location under monotonous gain functions on trees
DOI10.1016/J.DAM.2009.05.006zbMATH Open1225.05233OpenAlexW1964688335MaRDI QIDQ968153FDOQ968153
H.-C. 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
Recommendations
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
- scientific article; zbMATH DE number 1323029
- A competitive facility location problem on a tree network with stochastic weights.
- Multiple voting location and single voting location on trees
- Algorithms for Voting and Competitive Location on a Network
Social choice (91B14) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Hierarchical games (including Stackelberg games) (91A65) Spatial models in economics (91B72)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiple voting location and single voting location on trees
- Time bounds for selection
- Algorithms for Voting and Competitive Location on a Network
- Multiple voting location problems
- All Stackelberg location equilibria in the Hotelling's duopoly model on a tree with parametric prices
- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
- Relaxation of the Condorcet and Simpson conditions in voting location
- Title not available (Why is that?)
Cited In (4)
- Sequential competitive location on networks
- Locally guided randomized elections in trees: The totally fair case
- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
This page was built for publication: Relaxed voting and competitive location under monotonous gain functions on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968153)
