Competitive Facility Location along a Highway

  • Hee-Kap Ahn
  • Siu-Wing Cheng
  • Otfried Cheong
  • Mordecai Golin
  • René van Oostrum
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2108)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S.P. Anderson Equilibrium existence in a linear model of spatial competition. Economica, 55:479–491, 1988.CrossRefGoogle Scholar
  2. 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
  3. 3.
    H.A. Eiselt and G. Laporte Competitive spatial models. European Journal of Operational Research, 39:231–242, 1989.MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    H.A. Eiselt, G. Laporte, and J.-F. Thisse Competitive location models: A framework and bibliography. Transportation Science, 27:44–54, 1993.MATHGoogle Scholar
  5. 5.
    R.L. Francis and J.A. White Facility Layout and Location.Prentice-Hall, Inc., 1974.Google Scholar
  6. 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
  7. 7.
    M. Labbé and S.L. Hakimi Market and locational equilibrium for two competitors. Operations Research, 39:749–756, 1991.MATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    N. Megiddo Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Comput., 12:759–776, 1983.MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    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.MATHCrossRefGoogle Scholar
  10. 10.
    F.P. Preparata and M.I. Shamos Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.Google Scholar
  11. 11.
    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.MATHCrossRefMathSciNetGoogle Scholar
  12. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Hee-Kap Ahn
    • 1
  • Siu-Wing Cheng
    • 2
  • Otfried Cheong
    • 1
  • Mordecai Golin
    • 2
  • René van Oostrum
    • 1
  1. 1.Department of Computer ScienceUtrecht UniversityNetherlands
  2. 2.Department of Computer ScienceHKUSTHong Kong

Personalised recommendations