Competitive location under proportional choice: 1-suboptimal points on networks

Authors

  • Dominik Kress University of Siegen
  • Erwin Pesch University of Siegen

DOI:

https://doi.org/10.7494/dmms.2012.6.2.53

Keywords:

competitive location, voting location, vertex optimality, discretization, centroid problem

Abstract

This 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.

Downloads

Published

2012-12-23

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

Issue

Vol. 6 (2012): No. 1-2

Section

Articles

License

Remeber to prepeare, sign and scan copyright statement

Licencja Creative Commons
The content of the journal is freely available according to the Creative Commons License Attribution 4.0 International (CC BY 4.0)