Simplicity Effects in the Experience of Near-Miss

Near-miss experiences are one of the main sources of intense emotions. Despite people’s consistency when judging near-miss situations and when communicating about them, there is no integrated theoretical account of the phenomenon. In particular, individuals’ reaction to near-miss situations is not correctly predicted by rationality-based or probability-based optimization. The present study suggests that emotional intensity in the case of near-miss is in part predicted by Simplicity Theory.

💡 Research Summary

The paper tackles the puzzling phenomenon that near‑miss experiences—situations in which a desirable outcome was narrowly avoided—trigger intense emotions that cannot be adequately explained by traditional rational models based on expected utility or objective probability. The authors argue that people’s emotional responses are driven not merely by the size of the loss (Δv) or the physical distance (D) to a counterfactual win, as suggested by earlier work (e.g., Teigen’s L = Δv/D), but by a deeper cognitive assessment of how “unexpected” the event feels.

To formalize this intuition, the authors adopt Simplicity Theory (ST), a framework that uses concepts from algorithmic information theory. For any event s, ST defines two quantities: (1) the generation complexity Cw(s)—the minimal amount of information the “world” must supply to produce s, and (2) the description complexity C(s)—the minimal information needed by an observer to uniquely describe s. The difference U(s) = Cw(s) − C(s) is termed unexpectedness. The larger U, the more surprising (and thus emotionally salient) the event. ST then maps unexpectedness onto a subjective probability via p(s) = 2^{−U(s)}. This formulation captures the intuition that events that are “too simple” (easy to describe but hard to generate) feel improbable, a pattern that standard probability theory overlooks.

The authors first demonstrate that a pure utility‑distance model fails to predict participants’ judgments. In a ski‑holiday scenario, three accidents have identical objective probabilities but differ in when they occur (first day, third day, last day). Although the last‑day accident leaves the most “utility” intact, participants rate it as equally or more maddening than the earlier accidents, indicating that temporal proximity (a form of distance) alone cannot account for the emotional intensity.

Next, the paper presents three sets of lottery experiments (one‑dimensional with fixed or variable winning zones, and a two‑dimensional grid). Participants viewed graphical representations of a dot landing just outside a winning region and ranked their disappointment on a 1–5 (or 6) scale. Crucially, the objective winning probability was held constant across many conditions, yet participants’ rankings varied dramatically. For example, in the one‑dimensional case, moving the winning zone closer to the actual miss (reducing the physical gap δ) dramatically increased reported frustration, even when the overall probability of winning remained unchanged. This pattern contradicts a purely probabilistic account and also diverges from the simple distance‑based model.

Applying ST, the authors model the actual miss as event s₁ and a hypothetical winning position as s₂. The generation complexity of any landing site on a uniform line is Cw(s) = log₂(L/a), where L is the length of the line and a the minimal distinguishable unit. The description complexity of the actual miss, being a typical losing point, is C(s₁) = log₂(l₁/a) (l₁ = length of the losing interval). Hence the unexpectedness of the miss is U₁ = log₂(L/l₁). For a standard winning location, U₂ = log₂(L/l₂).

The crucial step is to evaluate the “almost” component: the counterfactual winning point s₂ that is closest to s₁. The conditional generation complexity Cw(s₂ | s₁) quantifies the minimal extra information needed to shift the world’s outcome from s₁ to s₂. In the one‑dimensional case this equals 1 + log₂(δ/a) (one bit to indicate direction, plus bits for the magnitude of the shift). Because the winning point is highly salient, its description complexity can be taken as C(s₂) ≈ 0. Consequently, the unexpectedness of the miss relative to the near win becomes

U(s₁) > log₂(L/δ) − 1.

Thus, the smaller the physical gap δ, the larger the unexpectedness, and the stronger the emotional reaction—exactly what the empirical data show. The authors extend the calculation to the two‑dimensional grid, where the conditional generation complexity adds two bits for choosing among four quadrants, yielding a similar logarithmic relationship that matches participants’ rankings across conditions.

Overall, the paper makes two major contributions. First, it provides a quantitative, information‑theoretic account of near‑miss emotions, showing that the feeling of “almost winning” is rooted in the disparity between how simple the event appears and how complex it would be for the world to generate it. Second, it introduces a subjective probability derived from unexpectedness, offering a bridge between cognitive assessments of surprise and formal probabilistic reasoning.

Limitations include the reliance on idealized logarithmic approximations for complexity, the relatively constrained experimental stimuli (simple lotteries), and the omission of broader contextual factors such as personal goals, social comparison, or affective traits that may modulate near‑miss reactions. Future work could test ST in richer real‑world domains (e.g., gambling, medical diagnosis, sports) and refine complexity estimation methods (perhaps using compression algorithms) to better capture human judgments. Nonetheless, the study convincingly demonstrates that simplicity—rather than raw probability—plays a pivotal role in shaping the emotional impact of near‑miss experiences.