Competitive Facility Location along a Highway
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.
Unable to display preview. Download preview PDF.
- 2.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.Google Scholar
- 5.R.L. Francis and J.A. White Facility Layout and Location.Prentice-Hall, Inc., 1974.Google Scholar
- 6.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.Google Scholar
- 10.F.P. Preparata and M.I. Shamos Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.Google Scholar
- 12.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.Google Scholar