Abstract
In the (r∣p)-centroid problem, two players, called leader and follower, open facilities to service clients. We assume that clients are identified with their location on the Euclidean plane, and facilities can be opened anywhere in the plane. The leader opens p facilities. Later on, the follower opens r facilities. Each client patronizes the closest facility. In case of ties, the leader’s facility is preferred. The goal is to find p facilities for the leader to maximize his market share. We show that this Stackelberg game is \(\varSigma_{2}^{P}\)-hard. Moreover, we strengthen the previous results for the discrete case and networks. We show that the game is \(\varSigma_{2}^{P}\)-hard even for planar graphs for which the weights of the edges are Euclidean distances between vertices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alekseeva E, Kochetova N, Kochetov Y, Plyasunov A (2010) Heuristic and exact methods for the discrete (r|p)-centroid problem. Lect Notes Comput Sci 6022:11–22
Alekseeva E, Kochetov Y (2013) Matheuristics and exact methods for the discrete (r|p)-centroid problem. In: Talbi E, Brotcorne L (eds) Metaheuristics for bi-level optimization. Springer, Berlin (in press)
Beresnev VL, Suslov VI (2010) A mathematical model of market competition. J Appl Ind Math 4(2):147–157
Carrizosa E, Davydov I, Kochetov Y (2011) A new alternating heuristic for the (r|p)-centroid problem on the plane. In: Klatte D, Lüthi H-J, Schmedders K (eds) Operations research proceedings 2011. Springer, Berlin, pp 275–280
Drezner Z (1982) Competitive location strategies for two facilities. Reg Sci Urban Econ 12:485–493
Bhadury J, Eiselt HA, Jaramillo JH (2003) An alternating heuristic for medianoid and centroid problems in the plane. Comput Oper Res 30:553–565
Hakimi SL (1981) On locating new facilities in a competitive environment. In: ISOLDE conference, Skodsborg, Denmark
Hakimi SL (1990) Locations with spatial interactions: competitive locations and games. In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley, New York, pp 439–478
Kress D, Pesch E (2012) Sequential competitive location on networks. Eur J Oper Res 217:483–499
Megiddo N, Supowit K (1994) On the complexity of some common geometric location problems. SIAM J Comput 13(1):182–196
Noltemeier H, Spoerhase J, Wirth HC (2007) Muliple voting location and single voting location on trees. Eur J Oper Res 181:654–667
Rodriguez CMC, Perez JAM (2008) Multiple voting location problems. Eur J Oper Res 191(2):437–453
Roboredo MC, Pessoa AA (2013) A branch-and-cut algorithm for the (r|p)-centroid problem. Eur J Oper Res 224(1):101–109
Schaefer M, Umans C (2002) Completeness in the polynomial-time hierarchy: Part I: A compendium. ACM SIGACT News 37(33):32–49
Spoerhase J (2012) Competitive and voting location. Ph.D. Thesis, University of Würzburg
Acknowledgements
Many thanks to Alexander Kononov for his fruitful comments and discussions. This work was supported by the Russian Foundation for Basic Research, Grants 12-01-00077 and 11-07-000474.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Davydov, I., Kochetov, Y. & Plyasunov, A. On the complexity of the (r|p)-centroid problem in the plane. TOP 22, 614–623 (2014). https://doi.org/10.1007/s11750-013-0275-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-013-0275-y