iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-3-642-22685-4_19
Optimal Strategies for the One-Round Discrete Voronoi Game on a Line | SpringerLink
Skip to main content

Optimal Strategies for the One-Round Discrete Voronoi Game on a Line

  • Conference paper
Computing and Combinatorics (COCOON 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6842))

Included in the following conference series:

  • 863 Accesses

Abstract

The one-round discrete Voronoi game, with respect to a n-point user set \(\mathcal U\), consists of two players Player 1 (P1) and Player 2 (P2). At first, P1 chooses a set \(\mathcal F_1\) of m facilities following which P2 chooses another set \(\mathcal F_2\) of m facilities, disjoint from \(\mathcal F_1\), where m = O(1) is a positive constant. The payoff of a player i is defined as the cardinality of the set of points in \(\mathcal U\) which are closer to a point in \(\mathcal F_i\) than to every point in \(\mathcal F_j\), for i ≠ j. The objective of both the players in the game is to maximize their respective payoffs. In this paper, we address the case where the points in \(\mathcal U\) are located along a line. We show that if the sorted order of the points in \(\mathcal U\) along the line is known, then the optimal strategy of P2, given any placement of facilities by P1, can be computed in O(n) time. We then prove that for m ≥ 2 the optimal strategy of P1 in the one-round discrete Voronoi game, with the users on a line, can be computed in \(O(n^{m-\lambda_m})\) time, where 0 < λ m  < 1, is a constant depending only on m.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ahn, H.-K., Cheng, S.-W., Cheong, O., Golin, M., van Oostrum, R.: Competitive facility location: the Voronoi game. Theor. Comput. Sci. 310, 457–467 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bhattacharya, B.B.: Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location. J. Math. Model. Algor. 9(4), 375–392 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bhattacharya, B.B., Nandy, S.C.: New variations of the reverse facility location problem. In: Proc. 22nd Canadian Conference on Computational Geometry, pp. 241–244 (2010)

    Google Scholar 

  4. Cabello, S., Miguel Diáz-Báñez, J., Langerman, S., Seara, C., Ventura, I.: Facility location problems in the plane based on reverse nearest neighbor queries. Eur. J. Operations Research 202(1), 99–106 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cheong, O., Efrat, A., Har-Peled, S.: On finding a guard that sees most and a shop that sells most. Discrete Computational Geometry 37, 545–563 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cheong, O., Har-Peled, S., Linial, N., Matouŝek, J.: The one-round Voronoi game. Discrete and Computational Geometry 31(1), 125–138 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dehne, F., Klein, R., Seidel, R.: Maximizing a Voronoi region: the convex case. Int. Journal of Computational Geometry and Applications 15, 463–475 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Eiselt, H.A., Laporte, G.: Competitive spatial models. Eur. J. Operations Research 39, 231–242 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  9. Eiselt, H.A., Laporte, G., Thisse, J.F.: Competitive location models: A framework and bibliography. Transportation Science 27, 44–54 (1993)

    Article  MATH  Google Scholar 

  10. Fekete, S.P., Meijer, H.: The one-round Voronoi game replayed. Comput. Geom. Theory Appl. 30(2), 81–94 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Spoerhase, J., Wirth, H.-C.: (r, p)-centroid problems on paths and trees. Theor. Comput. Sci. 410(47-49), 5128–5137 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Tobin, R., Friesz, T., Miller, T.: Existence theory for spatially competitive network facility location models. Annals of Operations Research 18, 267–276 (1989)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Banik, A., Bhattacharya, B.B., Das, S. (2011). Optimal Strategies for the One-Round Discrete Voronoi Game on a Line. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22685-4_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22684-7

  • Online ISBN: 978-3-642-22685-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics