IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v26y2013i4d10.1007_s10878-011-9447-6.html
   My bibliography  Save this article

Optimal strategies for the one-round discrete Voronoi game on a line

Author

Listed:
  • Aritra Banik

    (Indian Statistical Institute)

  • Bhaswar B. Bhattacharya

    (Stanford University)

  • Sandip Das

    (Indian Statistical Institute)

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 P2 is defined as the cardinality of the set of points in $\mathcal{U}$ which are closer to a facility in $\mathcal{F}_{2}$ than to every facility in $\mathcal{F}_{1}$ , and the payoff of P1 is the difference between the number of users in $\mathcal{U}$ and the payoff of P2. 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

Suggested Citation

  • Aritra Banik & Bhaswar B. Bhattacharya & Sandip Das, 2013. "Optimal strategies for the one-round discrete Voronoi game on a line," Journal of Combinatorial Optimization, Springer, vol. 26(4), pages 655-669, November.
  • Handle: RePEc:spr:jcomop:v:26:y:2013:i:4:d:10.1007_s10878-011-9447-6
    DOI: 10.1007/s10878-011-9447-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-011-9447-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-011-9447-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Eiselt, H. A. & Laporte, G., 1989. "Competitive spatial models," European Journal of Operational Research, Elsevier, vol. 39(3), pages 231-242, April.
    2. H. A. Eiselt & Gilbert Laporte & Jacques-François Thisse, 1993. "Competitive Location Models: A Framework and Bibliography," Transportation Science, INFORMS, vol. 27(1), pages 44-54, February.
    3. Cabello, S. & Díaz-Báñez, J.M. & Langerman, S. & Seara, C. & Ventura, I., 2010. "Facility location problems in the plane based on reverse nearest neighbor queries," European Journal of Operational Research, Elsevier, vol. 202(1), pages 99-106, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Anna Angelucci & Vittorio Bilò & Michele Flammini & Luca Moscardelli, 2015. "On the sequential price of anarchy of isolation games," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 165-181, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bhattacharya, Bhaswar B. & Nandy, Subhas C., 2013. "New variations of the maximum coverage facility location problem," European Journal of Operational Research, Elsevier, vol. 224(3), pages 477-485.
    2. Gentile, José & Alves Pessoa, Artur & Poss, Michael & Costa Roboredo, Marcos, 2018. "Integer programming formulations for three sequential discrete competitive location problems with foresight," European Journal of Operational Research, Elsevier, vol. 265(3), pages 872-881.
    3. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    4. Haase, Knut & Hoppe, Mirko, 2008. "Standortplanung unter Wettbewerb - Teil 1: Grundlagen," Discussion Papers 2/2008, Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics.
    5. Rhim, Hosun & Ho, Teck H. & Karmarkar, Uday S., 2003. "Competitive location, production, and market selection," European Journal of Operational Research, Elsevier, vol. 149(1), pages 211-228, August.
    6. Daniel Serra & Charles Revelle, 1994. "Competitive location in discrete space," Economics Working Papers 96, Department of Economics and Business, Universitat Pompeu Fabra.
    7. Wenxuan Shan & Qianqian Yan & Chao Chen & Mengjie Zhang & Baozhen Yao & Xuemei Fu, 2019. "Optimization of competitive facility location for chain stores," Annals of Operations Research, Springer, vol. 273(1), pages 187-205, February.
    8. Marianov, Vladimir & Rí­os, Miguel & Icaza, Manuel José, 2008. "Facility location for market capture when users rank facilities by shorter travel and waiting times," European Journal of Operational Research, Elsevier, vol. 191(1), pages 32-44, November.
    9. Plastria, Frank, 2001. "Static competitive facility location: An overview of optimisation approaches," European Journal of Operational Research, Elsevier, vol. 129(3), pages 461-470, March.
    10. Rafael Suárez‐Vega & Dolores R. Santos‐Peñate & Pablo Dorta‐González, 2004. "Competitive Multifacility Location on Networks: the (r∣Xp)‐Medianoid Problem," Journal of Regional Science, Wiley Blackwell, vol. 44(3), pages 569-588, August.
    11. Cabello, S. & Díaz-Báñez, J.M. & Langerman, S. & Seara, C. & Ventura, I., 2010. "Facility location problems in the plane based on reverse nearest neighbor queries," European Journal of Operational Research, Elsevier, vol. 202(1), pages 99-106, April.
    12. Daniel Serra & Charles Revelle, 1997. "Competitive location and pricing on networks," Economics Working Papers 219, Department of Economics and Business, Universitat Pompeu Fabra.
    13. Roboredo, Marcos Costa & Pessoa, Artur Alves, 2013. "A branch-and-cut algorithm for the discrete (r∣p)-centroid problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 101-109.
    14. Hai Yang & S. C. Wong, 2000. "A Continuous Equilibrium Model for Estimating Market Areas of Competitive Facilities with Elastic Demand and Market Externality," Transportation Science, INFORMS, vol. 34(2), pages 216-227, May.
    15. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.
    16. Clara Campos Rodríguez & Dolores Santos Peñate & José Moreno Pérez, 2010. "An exact procedure and LP formulations for the leader—follower location problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 97-121, July.
    17. Michler, Jeffrey D. & Gramig, Benjamin M., 2012. "Differentiation in a Two-Dimensional Market with Endogenous Sequential Entry," 2012 Annual Meeting, August 12-14, 2012, Seattle, Washington 124845, Agricultural and Applied Economics Association.
    18. Rahul Swamy & Timothy Murray, 0. "Computing equilibrium in network utility-sharing and discrete election games," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-29.
    19. R Aboolian & O Berman & D Krass, 2008. "Optimizing pricing and location decisions for competitive service facilities charging uniform price," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1506-1519, November.
    20. Michael Grubb, 2015. "Failing to Choose the Best Price: Theory, Evidence, and Policy," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 47(3), pages 303-340, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:26:y:2013:i:4:d:10.1007_s10878-011-9447-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.