Article citationsMore>>

M. Smid, “Closest Point Problems in Computational Geometry,” In: J.-R. Sack and J. Urrutia, Eds., Handbook on Computational Geometry, Elsevier Science, Amsterdam, 1997.

has been cited by the following article:

• TITLE: Geometric Study of the Weak Equilibrium in a Weighted Case for a Two-Dimensional Competition Game

  AUTHORS: López M. Dolores, Rodrigo Javier, Sánchez José Manuel

  KEYWORDS: Game Theory; Approximated Equilibrium; Location; Computational Geometry; Convex Hull

  JOURNAL NAME: American Journal of Operations Research, Vol.3 No.3, May 23, 2013

  ABSTRACT: In this work, an improvement of the results presented by [1] Abellanas et al. (Weak Equilibrium in a Spatial Model. International Journal of Game Theory, 40(3), 449-459) is discussed. Concretely, this paper investigates an abstract game of competition between two players that want to earn the maximum number of points from a finite set of points in the plane. It is assumed that the distribution of these points is not uniform, so an appropriate weight to each position is assigned. A definition of equilibrium which is weaker than the classical one is included in order to avoid the uniqueness of the equilibrium position typical of the Nash equilibrium in these kinds of games. The existence of this approximated equilibrium in the game is analyzed by means of computational geometry techniques.