Table of Contents
Fetching ...

Gaussian Cumulative Prospect Theory

Mederic Motte

TL;DR

Addresses decision-making under risk using Cumulative Prospect Theory for Gaussian rewards. Proposes parametric families for rewards, values, and weights with validity and richness, plus a closed-form gamble valuation for $R$ distributed as $N(mu,sigma)$. Demonstrates analytic gradients with respect to model parameters, enabling efficient gradient-based optimization in large-scale settings. Illustrates two population-oriented applications—design optimization and equilibrium computation—that benefit from fast, scalable CPT valuations.

Abstract

We propose a novel parametrization of Cumulative Prospect Theory (CPT), as developed by Daniel Kahneman and Amos Tversky, that yields an explicit gamble valuation formula for Gaussian reward distributions. Specifically, we define parametric functions $ v_θ $, $ w^{-}_θ $, and $ w^{+}_θ $ satisfying three key properties. The first, \emph{validity}, ensures that for any parameter $θ$, the functions conform to the qualitative principles of CPT: $ v_θ $ is concave over gains and convex over losses with a steeper slope for losses; $ w^{-}_θ $ and $ w^{+}_θ $ are increasing, exhibit inverse S-shaped curves, and map 0 to 0 and 1 to 1. The second, \emph{richness}, guarantees that the parametrization is expressive enough to capture a wide range of behaviors: $ v_θ $ can exhibit arbitrary asymptotic behavior and convergence rates, while $ w^{-}_θ $ and $ w^{+}_θ $ can achieve any specified crossover points and slopes. The third, \emph{explicit valuation}, ensures that for any $θ$, the CPT valuation of a Gaussian-distributed gamble (with arbitrary mean and variance) can be computed in closed form -- enabling efficient approximations for bell-shaped reward distributions. This framework is designed for scalable and rapid computation, making it particularly suited for applications involving large populations. We demonstrate its practicality through two illustrative examples in population-level CPT modeling.

Gaussian Cumulative Prospect Theory

TL;DR

Addresses decision-making under risk using Cumulative Prospect Theory for Gaussian rewards. Proposes parametric families for rewards, values, and weights with validity and richness, plus a closed-form gamble valuation for distributed as . Demonstrates analytic gradients with respect to model parameters, enabling efficient gradient-based optimization in large-scale settings. Illustrates two population-oriented applications—design optimization and equilibrium computation—that benefit from fast, scalable CPT valuations.

Abstract

We propose a novel parametrization of Cumulative Prospect Theory (CPT), as developed by Daniel Kahneman and Amos Tversky, that yields an explicit gamble valuation formula for Gaussian reward distributions. Specifically, we define parametric functions , , and satisfying three key properties. The first, \emph{validity}, ensures that for any parameter , the functions conform to the qualitative principles of CPT: is concave over gains and convex over losses with a steeper slope for losses; and are increasing, exhibit inverse S-shaped curves, and map 0 to 0 and 1 to 1. The second, \emph{richness}, guarantees that the parametrization is expressive enough to capture a wide range of behaviors: can exhibit arbitrary asymptotic behavior and convergence rates, while and can achieve any specified crossover points and slopes. The third, \emph{explicit valuation}, ensures that for any , the CPT valuation of a Gaussian-distributed gamble (with arbitrary mean and variance) can be computed in closed form -- enabling efficient approximations for bell-shaped reward distributions. This framework is designed for scalable and rapid computation, making it particularly suited for applications involving large populations. We demonstrate its practicality through two illustrative examples in population-level CPT modeling.
Paper Structure (15 sections, 4 theorems, 33 equations)

This paper contains 15 sections, 4 theorems, 33 equations.

Key Result

Theorem 1.1

Let $v \in {\cal V}$ and $w^- = w_{p_0^-, \gamma^-},\ w^+ = w_{p_0^+, \gamma^+} \in {\cal W}$. Then:

Theorems & Definitions (6)

  • Theorem 1.1
  • Definition 2.1: Valid Weighting Function for CPT
  • Definition 2.2: Normal Distortion Function
  • Proposition 2.1
  • Lemma 2.1
  • Theorem 3.1