Skip to main content

Fault-Tolerant Hotelling Games

  • Chapter
  • First Online:
Game Theory for Networking Applications

Part of the book series: EAI/Springer Innovations in Communication and Computing ((EAISICC))

  • 817 Accesses

Abstract

The n-player Hotelling game calls for each player to choose a point on the line segment, so as to maximize the size of his Voronoi cell. This paper studies fault-tolerant versions of the Hotelling game. Two fault models are studied. The first assumes that the environment is prone to failure: with some probability, a disconnection occurs at a random point on the line, splitting it into two separate segments and modifying each player’s Voronoi cell accordingly. A complete characterization of the Nash equilibria of this variant is provided for every n. Additionally, a one-to-one correspondence is shown between equilibria of this variant and of the Hotelling game with no faults. The second fault model assumes the players are prone to failure: each player is removed from the game with i.i.d. probability, changing the payoffs of the remaining players accordingly. It is shown that for n ≥ 3 this variant of the game has no Nash equilibria.

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

Access this chapter

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 EPUB and 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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Avin, C., Cohen, A., Lotker, Z., Peleg, D.: Fault-tolerant hotelling games. CoRR abs/1801.04669 (2017). http://arxiv.org/abs/1801.04669

  2. Chechik, S., Peleg, D.: Robust fault tolerant uncapacitated facility location. Theor. Comput. Sci. 543, 9–23 (2014)

    Article  MathSciNet  Google Scholar 

  3. Chechik, S., Peleg, D.: The fault-tolerant capacitated k-center problem. Theor. Comput. Sci. 566, 12–25 (2015)

    Article  MathSciNet  Google Scholar 

  4. De Palma, A., Ginsburgh, V., Thisse, J.F.: On existence of location equilibria in the 3-firm hotelling problem. J. Ind. Econ. 36, 245–252 (1987)

    Article  Google Scholar 

  5. Eaton, B.C., Lipsey, R.G.: The principle of minimum differentiation reconsidered: some new developments in the theory of spatial competition. Rev. Econ. Stud. 42(1), 27–49 (1975)

    Article  Google Scholar 

  6. Eiselt, H.A.: Equilibria in competitive location models. In: Foundations of Location Analysis, pp. 139–162. Springer, Berlin (2011)

    Google Scholar 

  7. Eiselt, H.A., Laporte, G., Thisse, J.F.: Competitive location models: a framework and bibliography. Transp. Sci. 27(1), 44–54 (1993)

    Article  Google Scholar 

  8. Gradwohl, R., Reingold, O.: Fault tolerance in large games. Games Econ. Behav. 86, 438–457 (2014)

    Article  MathSciNet  Google Scholar 

  9. Hotelling, H.: Stability in competition. Econ. J. 39(153), 41–57 (1929)

    Article  Google Scholar 

  10. Khuller, S., Pless, R., Sussmann, Y.J.: Fault tolerant k-center problems. Theor. Comput. Sci. 242(1–2), 237–245 (2000)

    Article  MathSciNet  Google Scholar 

  11. Snyder, L.V., Atan, Z., Peng, P., Rong, Y., Schmitt, A.J., Sinsoysal, B.: Or/ms models for supply chain disruptions: a review. IIE Trans. 48(2), 89–109 (2016)

    Article  Google Scholar 

  12. Sviridenko, M.: An improved approximation algorithm for the metric uncapacitated facility location problem. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 240–257. Springer, Berlin (2002)

    Google Scholar 

  13. Swamy, C., Shmoys, D.B.: Fault-tolerant facility location. ACM Trans. Algorithms 4(4), 51 (2008)

    Article  MathSciNet  Google Scholar 

  14. Wang, X., Ouyang, Y.: A continuum approximation approach to competitive facility location design under facility disruption risks. Transp. Res. B Methodol. 50, 90–103 (2013)

    Article  Google Scholar 

  15. Zhang, Y., Snyder, L.V., Ralphs, T.K., Xue, Z.: The competitive facility location problem under disruption risks. Transp. Res. E Logist. Transp. Rev. 93, 453–473 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chen Avin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Avin, C., Cohen, A., Lotker, Z., Peleg, D. (2019). Fault-Tolerant Hotelling Games. In: Song, J., Li, H., Coupechoux, M. (eds) Game Theory for Networking Applications. EAI/Springer Innovations in Communication and Computing. Springer, Cham. https://doi.org/10.1007/978-3-319-93058-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93058-9_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93057-2

  • Online ISBN: 978-3-319-93058-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics