Geometric versions of finite games: Prisoner’s dilemma, entry deterrence and a cyclical majority paradox

The paper provides geometric versions of finite, two-person games in the course of proving the following: if a finite, two-person, symmetric game is constant-sum, it is a location game. If it is not constant-sum, it is a location game with a reservation price. Every finite two-person game is a location game with a reservation price and two location sets, one for each player. The paper then uses location games to resolve a cyclical majority paradox, and to analyse a prisoner’s dilemma and an entry deterrence game.