Three candidate election strategy

Paper: arXiv 2305.00693

Authors: Dorje C. Brody, Tomooki Yuasa

Abstract

The probability of a given candidate winning a future election is worked out in closed form as a function of (i) the current support rates for each candidate, (ii) the relative positioning of the candidates within the political spectrum, (iii) the time left to the election, and (iv) the rate at which noisy information is revealed to the electorate from now to the election day, when there are three or more candidates. It is shown, in particular, that the optimal strategy for controlling information can be intricate and nontrivial, in contrast to a two-candidate race. A surprising finding is that for a candidate taking the centre ground in an electoral competition among a polarised electorate, certain strategies are fatal in that the resulting winning probability for that candidate vanishes identically.

Complexity vs Empirical Score

• Math Complexity: 8.0/10
• Empirical Rigor: 2.5/10
• Quadrant: Lab Rats — theoretically deep, empirically untested

Why this score: The paper presents a rigorous theoretical framework using stochastic processes and information-relevance modeling to derive closed-form election probabilities for multi-candidate races. While mathematically rich and highly novel in its strategic insights for information control, it lacks real-world empirical validation or historical election backtesting.

Research Flowchart

  flowchart TD
    A["Research Goal: Calculate winning probabilities & optimal strategies in 3+ candidate elections"] --> B["Input Parameters: Support rates, spectrum position, time left, information rate"]
    B --> C["Methodology: Closed-form probabilistic modeling & game theory"]
    C --> D["Compute Future Support Dynamics & Winning Probabilities"]
    D --> E["Key Finding 1: Information control strategy is complex vs. 2-candidate races"]
    D --> F["Key Finding 2: Certain information strategies are fatal for centrist candidates"]