Relaxed voting and competitive location under monotonous gain functions on trees
From MaRDI portal
(Redirected from Publication:968153)
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
Cites work
- scientific article; zbMATH DE number 4199949 (Why is no real title available?)
- scientific article; zbMATH DE number 9247 (Why is no real title available?)
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- Algorithms for Voting and Competitive Location on a Network
- All Stackelberg location equilibria in the Hotelling's duopoly model on a tree with parametric prices
- 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
- Relaxation of the Condorcet and Simpson conditions in voting location
- Time bounds for selection
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
- -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)