We consider the Hotelling–Downs model with n⩾3 office-seeking candidates and runoff voting. We show that Nash equilibria in pure strategies always exist and that there are typically multiple equilibria, both convergent (all candidates are located at the median) and divergent (candidates...

In an evolutionary model, players from a given population meet randomly in pairs each instant to play a coordination game. At each instant, the learning model used is determined via some replicator dynamics that respects payoff fitness. We allow for two such models: a belief-based best-response...

Two players are endowed with resources for setting up N locations on K identical circles, with N K ≥ 1. The players alternately choose these locations (possibly in batches of more than one in each round) in order to secure the area closer to their locations than that of their rival's. They...