Skip to content
Open access

Loss Aversion as Optimal Attention Allocation: Mismatches Are the Squeaky Wheel

Jul 2026 · Mathematics · Vol 14, pp. 2652 · 0 citations · 33 references

Abstract

We study an agent who tracks several independent, unobserved, slowly drifting states and is paid by how well a chosen action matches each state but who can process only a bounded amount of information per period. The payoff environment is deliberately symmetric—quadratic matching losses, Gaussian drift, Gaussian observation noise—and the agent’s objective contains no asymmetry: we treat both the risk-neutral (linear) objective and the long-run log-growth (Kelly) objective. Within this symmetric environment, we show that the value of attentionis sharply asymmetric in the sign of the agent’s surprise. Because the matching payoff is maximized when action equals state, a surprisingly low payoff is strong evidence of a state mismatch that is worth correcting, whereas a surprisingly high payoff is evidence either of noise or of a match already achieved—in both cases carrying little decision-relevant information. We prove (Theorem 1) that the posterior expected mismatch, and hence the value of information, is strictly decreasing in the realized payoff, negligible for good surprises and rising steeply for bad ones, with a correspondingly asymmetric slope. We then show that an information-constrained agent optimally adopts a threshold attention policy (Theorem 2), which, under one explicit and standard bridge—that valuation inherits attention weight, as in salience and rational-inattention theories of choice—projects onto a reference-dependent value function with a kink at the expected payoff and a loss-side slope strictly steeper than its gain-side slope (Corollary 1): precisely the signature of loss aversion. The mechanism supplies the structure of loss aversion—its sign, its reference point, and how it varies with the environment—while its magnitude is one calibrated parameter that places the implied coefficient in the empirical range. Risk aversion follows as a corollary (Theorem 3): the kink induces first-order risk aversion over small symmetric gambles, inverting the usual hierarchy in which (second-order) risk aversion is primitive, and loss aversion is an add-on. The mechanism is immune to the Rabin calibration critique. Simulations benchmark the myopic policy against the computed optimum, map the mechanism’s robustness across noise tails, and locate the implied coefficient; we close with extensions to endogenous gain-seeking in convex (“gold-rush”) environments, population heterogeneity through learned priors, and a reading of hedonic affect as the Lagrange multiplier that prices a scarce attentional resource.

Read PDF

Similar papers

#machine learning Preprint Aug 2026

The concentration game: Bayesian updating, regret, and information

A two-player zero-sum repeated game between a learner and nature whose value identity generates Bayesian updating and an exact accounting of exponential-weights regret at once is given, and supplies the comparator-class variational form that a wide class of concentration phenomena share.

Akshay Balsubramani · 0 citations
Preprint Sep 2026

Suboptimality Loss for Inverse Learning from Imperfect Equilibria

Many modern systems involve the strategic interaction of multiple agents. In such settings, observed actions typically reflect equilibrium behavior under utilities that are only partially known. Recovering these hidden utilities from data - the central goal of inverse game theory - is key for prediction, counterfactual...

Andreas Feik, P. Pinson, Dario Paccagnan · 0 citations
Preprint Aug 2026

Random Cap: Optimal Informationally Robust Delegation

Are simple delegation rules optimal under ambiguity? We study delegation when the principal knows the mean, but not the distribution, of the agent's private information. In a parsimonious quadratic constant-bias environment, the robustly optimal randomized mechanism is a random cap: the principal draws and reveals an u...

Zhiyuan Jia · 2 citations
#machine learning Preprint Sep 2026

Minimax-Optimal Online Contract Design with Unrestricted Bounded Contracts

We study repeated contract design when a principal observes outcomes but not the actions that generate them. The principal may use any bounded outcome-contingent payment vector, and the agent's best response can make expected profit discontinuous in those payments. For every fixed number $m\ge2$ of outcomes, the minima...

Rui Ai, David Simchi-Levi, Han Zhong · 0 citations
Preprint Aug 2026

When should one stop the most exciting game? Sequential Inference for win-martingales

Prediction markets have become a prominent way of aggregating beliefs about binary future events, and their price processes are often interpreted as evolving win probabilities, or ``win-martingales.''Motivated by this perspective and recent work on Aldous'``most exciting game,''we study when a decision maker should sto...

Steven Campbell, Karl Kristian Engelund · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.