Competitive location under proportional choice: 1-suboptimal points on networks
DOI:
https://doi.org/10.7494/dmms.2012.6.2.53Keywords:
competitive location, voting location, vertex optimality, discretization, centroid problemAbstract
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.
References
Bandelt H.-J. (1985). Networks with Condorcet solutions. European Journal of Operational Research, 20(3), pp. 314–326. DOI: http://doi.org/10.1016/0377-2217(85)90004-9.
Bauer A., Domschke W. & Pesch E. (1993). Competitive location on a network. European Journal of Operational Research, 66(3), pp. 372–391. DOI: http://doi.org/10.1016/0377-2217(93)90224-B.
Birmingham Council (2011). Strategy for Special Provision (S4SP): Guidance. URL: http://ebriefing.bgfl.org/content/resources/resource.cfm?id=8009&key=&zz=20110130064926142&zs=n [08.04.2011].
Gross J.L. & Yellen J. (2004). Fundamentals of graph theory. In: J.L. Gross & J. Yellen (Eds.), Handbook of Graph Theory, pp. 2–19. CRC Press, Boca Raton. DOI rozdziału nadrzędnego: http://doi.org/10.1201/9780203490204.ch1.
Hakimi S.L. (1964). Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research, 12(3), pp. 450–459. DOI: http://doi.org/10.1287/opre.12.3.450.
Hakimi S.L. (1986). p-Median theorems for competitive locations. Annals of Operations Research, 6(4), pp. 75–98. DOI: http://doi.org/10.1007/BF02032873.
Hakimi S.L. (1990). Locations with spatial interactions: Competitive locations and games. In: P.B. Mirchandani & R.L. Francis (Eds.), Discrete Location Theory, pp. 439–478. Wiley-Interscience, New York.
Hansen P. & Labbé M. (1988). Algorithms for voting and competitive location on a network. Transportation Science, 22(4), pp. 278–288. DOI: http://doi.org/10.1287/trsc.22.4.278.
Hansen P. & Thisse J.-F. (1981). Outcomes of voting and planning: Condorcet, Weber and Rawls locations. Journal of Public Economics, 16(1), pp. 1–15. DOI: http://doi.org/10.1016/0047-2727(81)90039-6.
Hansen P., Thisse J.-F. & Wendell R.E. (1986). Equivalence of solutions to network location problems. Mathematics of Operations Research, 11(4), pp. 672–678. DOI: http://doi.org/10.1287/moor.11.4.672.
Hansen P., Thisse J.-F. & Wendell R.E. (1990). Equilibrium analysis for voting and competitive location problems. In: P.B. Mirchandani & R.L. Francis (Eds.), Discrete Location Theory, pp. 479–501. Wiley-Interscience, New York.
Hooker J.N., Garfinkel R.S. & Chen C.K. (1991). Finite dominating sets for network location problems. Operations Research, 39(1), pp. 100–118. DOI: http://doi.org/10.1287/opre.39.1.100.
Hotelling H. (1929). Stability in competition. The Economic Journal, 39(153), pp. 41–57. DOI: http://doi.org/10.2307/2224214.
Kress D. & Pesch E. (2012). Sequential competitive location on networks. European Journal of Operational Research, 217(3), pp. 483–499. DOI: http://doi.org/10.1016/j.ejor.2011.06.036.
Labbé M. (1985). Outcomes of voting and planning in single facility location problems. European Journal of Operational Research, 20(3), pp. 299–313. DOI: http://doi.org/10.1016/0377-2217(85)90003-7.
Simpson P.B. (1969). On defining areas of voter choice: Professor Tullock on stable voting. The Quarterly Journal of Economics, 83(3), pp. 478–490. DOI: http://doi.org/10.2307/1880533.
Swamy M.N.S. & Thulasiraman K. (1981). Graphs, Networks, and Algorithms. John Wiley & Sons, New York.
