Competitive Facility Location along a Highway

  • Hee-Kap Ahn
  • Siu-Wing Cheng
  • Otfried Cheong
  • Mordecai Golin
  • René van Oostrum
Conference paper

DOI: 10.1007/3-540-44679-6_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2108)
Cite this paper as:
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

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.

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