Abstract
We consider a competitive facility location problem with two players.Pla yers alternate placing points, one at a time, into the playing arena, until each of them has placed n points.The arena is then subdivided according to the nearest-neighbor rule, and the player whose points control the larger area wins.We present a winning strategy for the second player, where the arena is a circle or a line segment.
Part of the work was done while the first, third, and fifth authors were at the Dept.of Computer Science, HKUST, Hong Kong.The work described in this paper has been supported by the Research Grants Council of Hong Kong, China (HKUST6074/97E, HKUST8088/99E, HKUST6094/99E, HKUST6162/00E, and HKUST6137/98E).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S.P. Anderson Equilibrium existence in a linear model of spatial competition. Economica, 55:479–491, 1988.
B. Aronov, M. van Kreveld, R. van Oostrum, and K. V aradarajan Facility location on terrains. In K.Y. Chwa and Oscar H. Ibarra, editors, Proc. 9th International Symposium of Algorithms and Computation, volume 1533 of Lecture Notes Comput. Sci., pages 19–28.Springer-V erlag, 1998.
H.A. Eiselt and G. Laporte Competitive spatial models. European Journal of Operational Research, 39:231–242, 1989.
H.A. Eiselt, G. Laporte, and J.-F. Thisse Competitive location models: A framework and bibliography. Transportation Science, 27:44–54, 1993.
R.L. Francis and J.A. White Facility Layout and Location.Prentice-Hall, Inc., 1974.
S.L. Hakimi Location with spatial interactions: Competitive location and games. In R.L. Francis and P.B. Mirchandani, editors, Discrete Location Theory, pages 439–478.Wiley, New York, 1990.
M. Labbé and S.L. Hakimi Market and locational equilibrium for two competitors. Operations Research, 39:749–756, 1991.
N. Megiddo Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Comput., 12:759–776, 1983.
A. Okabe and M. Aoyagy Existence of equilibrium configurations of competitive firms on an infinite two-dimensional space. Journal of Urban Economics, 29:349–370, 1991.
F.P. Preparata and M.I. Shamos Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
R.L. Tobin T.L. Friesz and T. Miller Existence theory for spatially competitive network facility location models. Annals of Operations Research, 18:267–276, 1989.
Emo Welzl Smallest enclosing disks (balls and ellipsoids).In H. Maurer, editor, New Results and New Trends in Computer Science, volume 555 of Lecture Notes Comput. Sci., pages 359–370.Springer-V erlag, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, HK., Cheng, SW., Cheong, O., Golin, M., van Oostrum, R. (2001). Competitive Facility Location along a Highway. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_26
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive