
Hotelling-Downs plurality competition on a line
Source:R/SpatialCompetition.R
PluralityCompetition.RdEach voter supports the nearest candidate (ties split equally);
candidates maximise their vote share (Hotelling 1929, Downs 1957). With a
finite electorate a candidate's share, as its position y varies, changes
only where it becomes equidistant with a rival for some voter
(\(y = c_k\) or \(y = 2v - c_k\)); the best response is found exactly
by evaluating those breakpoints and the midpoints between them. The
configuration is a Nash equilibrium when no candidate can raise its
share. Without positions the two-candidate equilibrium is
returned: both candidates at the median.
Value
List with shares, positions, best_response
(location and share per candidate), gain, is_equilibrium
and median_interval.