Skip to content

Median Voter Theorem


Theorem

Consider a policy interval [a‾,aˉ]⊂R[\underline a,\bar a]\subset\mathbb{R} and a continuum of voters whose ideal points have a continuous, strictly increasing cumulative distribution function FF on [a‾,aˉ][\underline a,\bar a], with median mm, so F(m)=12F(m)=\tfrac{1}{2}. Each voter votes for the candidate whose platform is closest to her ideal point (a voter at equal distance splits her vote equally). Two candidates choose platforms a1,a2∈[a‾,aˉ]a_1,a_2\in[\underline a,\bar a] simultaneously; the candidate with more votes wins, and a tie is broken by a fair coin. Each candidate cares only about winning: payoff 11 for a win, 00 for a loss, so 12\tfrac{1}{2} in expectation for a tie.

Then the game has a unique Nash equilibrium, a1∗=a2∗=ma_1^*=a_2^*=m. Normalizing the median to 00 gives a1∗=a2∗=0a_1^*=a_2^*=0.


Interpretation

The result goes back to Hotelling's (1929) model of firms locating on a line and Downs's (1957) model of party competition. A candidate's vote share depends only on which side of the midpoint between the two platforms each voter lies, so moving towards the rival, while staying on one's own side, captures voters. The only position that cannot be beaten is the median.

Density 2x of voter ideal points on [0,1] with the rival at the median 0.707 and candidate 1 at 0.5; the area left of the midpoint 0.6036 (0.364) is blue, the rest (0.636) red.

The figure draws the skewed-electorate example, F(x)=x2F(x)=x^2 with density 2x2x and median m=1/2≈0.707m=1/\sqrt{2}\approx0.707. The rival stands at a2=ma_2=m and candidate 1 deviates to a1=0.5a_1=0.5. Every voter left of the midpoint a1+a22≈0.6036\tfrac{a_1+a_2}{2}\approx0.6036 is closer to a1a_1, so candidate 1's vote share is the blue area F(0.6036)≈0.364<12F(0.6036)\approx0.364<\tfrac{1}{2} and she loses. Moving a1a_1 to the right shifts the midpoint and grows the blue area, but it reaches 12\tfrac{1}{2} only when a1=ma_1=m.

Each assumption matters: one policy dimension, single-peaked preferences (here: distance-based), exactly two office-seeking candidates, no abstention and no entry. With three or more candidates, or with candidates who care about the policy itself, convergence to the median generally fails.

The prediction is the median, not the mean, of the ideal points; the two differ for a skewed distribution. Convergence is also not a welfare optimum in the location version (see the beach example).


Key Results

  • (m,m)(m,m) is an equilibrium: each candidate gets 12\tfrac{1}{2}; a deviation to a1<ma_1<m gives candidate 1 the vote share F(a1+m2)<12F\big(\tfrac{a_1+m}{2}\big)<\tfrac{1}{2}, a sure loss (symmetrically for a1>ma_1>m).
  • No other profile is an equilibrium. If a1=a2=a≠ma_1=a_2=a\neq m, either candidate wins outright by moving to mm. If a1<a2a_1<a_2 and one candidate wins, the loser can copy the winner's platform and raise her payoff from 00 to 12\tfrac{1}{2}. If a1<a2a_1<a_2 and they tie, then a1+a22=m\tfrac{a_1+a_2}{2}=m, and candidate 1 wins outright by moving to any point strictly between a1a_1 and a2a_2.
  • The best response to a rival at a2≠ma_2\neq m is the set of platforms in [a‾,aˉ][\underline a,\bar a] strictly between a2a_2 and the point 2m−a22m-a_2, which win outright.
  • Discrete version (Black): with an odd number of voters with single-peaked preferences, the median ideal point beats every other alternative in a pairwise majority vote.

Examples

Skewed electorate. Let F(x)=x2F(x)=x^2 on [0,1][0,1]. The median solves m2=12m^2=\tfrac{1}{2}, so m=1/2≈0.707m=1/\sqrt{2}\approx0.707, while the mean is ∫01x⋅2x dx=23≈0.667\int_0^1 x\cdot2x\,\mathrm{d}x=\tfrac{2}{3}\approx0.667. Both candidates locate at m≈0.707m\approx0.707. If candidate 1 deviates to 0.50.5, the midpoint is (0.5+m)/2≈0.6036(0.5+m)/2\approx0.6036 and her share is F(0.6036)≈0.364<12F(0.6036)\approx0.364<\tfrac{1}{2}.

Five voters. Ideal points 1,2,4,7,91,2,4,7,9; the median is 44 and the mean is 4.64.6. In a vote between 44 and 4.64.6, the voters at 1,2,41,2,4 (ideal point below the midpoint 4.34.3) prefer 44, a majority of 33 out of 55.

Beach vendors. Customers are uniformly distributed on [0,1][0,1] and buy from the nearest vendor. In equilibrium both vendors stand at 12\tfrac{1}{2}, with average walking distance E∣X−12∣=14\mathbb{E}|X-\tfrac{1}{2}|=\tfrac{1}{4}. Locations 14\tfrac{1}{4} and 34\tfrac{3}{4} would halve this to 18\tfrac{1}{8}, so the equilibrium is not efficient for the customers.


Prerequisites



Sources

Aliases: median voter model, Hotelling–Downs model, Hotelling-Downs model, Downsian model Keywords: Hotelling, Downs, location game, single-peaked preferences, policy convergence, ice-cream vendors on a beach Symbols: element of, integral, real numbers, square root, subset

Last updated: 27 October 2026 11:52