Competitive location under proportional choice: 1-suboptimal points on networks
Keywords:competitive location, voting location, vertex optimality, discretization, centroid problem
AbstractThis paper is concerned with a competitive or voting location problem on networks under a proportional choice rule that has previously been introduced by Bauer et al. (1993). We refine a discretization result of the authors by proving convexity and concavity properties of related expected payoff functions. Furthermore, we answer the long time open question whether 1-suboptimal points are always vertices by providing a counterexample on a tree network.
How to Cite
Kress, D., & Pesch, E. (2012). Competitive location under proportional choice: 1-suboptimal points on networks. Decision Making in Manufacturing and Services, 6(1), 53–64. https://doi.org/10.7494/dmms.2012.6.2.53
Remeber to prepeare, sign and scan copyright statement
Ten utwór jest dostępny na licencji Creative Commons Attribution-NoDerivatives 4.0 Międzynarodowe.