What does Choice Architecture and Pricing Interfaces conclude, in numbers, about “Cumulative Prospect Theory: Value Functions, Probability Weights and Rank Dependence”?
Answer: The value-function parameters of 1992 cumulative prospect theory, \(\alpha = \beta = 0.88\) and \(\lambda = 2.25\), match the author's framework, but they are medians from 25 graduate students not paid according to their choices. The 1992 weighting function is \(p\gamma/(p\gamma + (1-p)\gamma){1/\gamma}\) (\(\gamma = 0.61\), \(\delta = 0.69\)); \(\exp(-(-\ln p)^\alpha)\) is Prelec's different 1998 function, 0.65 is an illustrative value, and the parameter closest to the 1992 gain curve is 0.501. Cumulative prospect theory weights cumulative probabilities and takes differences; separable weighting prefers a dominated lottery and lifts the certainty equivalent to 316.63 when one outcome is split 50 ways, cumulative weights do not.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's models and hypotheses; all data in the book are fictional or simulated.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.501, 0.61, 2.25
| v(100) = 57.5, v(-100) = -129.5; |v(-x)| / v(x) = 2.25 for every x because a = b | ||||
| Prelec exponent fitted to TK gains (g = 0.61): c = 0.501 | ||||
| p | TK gain | TK loss | Prelec .65 | Prelec fit |
| 0.001 | 0.014 | 0.008 | 0.030 | 0.072 |
| 0.010 | 0.055 | 0.040 | 0.067 | 0.117 |
| 0.050 | 0.132 | 0.111 | 0.130 | 0.177 |
| 0.100 | 0.186 | 0.170 | 0.179 | 0.219 |
| 0.250 | 0.291 | 0.294 | 0.290 | 0.308 |
| 0.500 | 0.421 | 0.454 | 0.455 | 0.435 |
| 0.750 | 0.568 | 0.626 | 0.641 | 0.585 |
| 0.900 | 0.712 | 0.775 | 0.793 | 0.723 |
| 0.950 | 0.793 | 0.850 | 0.865 | 0.798 |
| 0.990 | 0.912 | 0.945 | 0.951 | 0.905 |
| fixed point w(p) = p, TK gain | : p = 0.339 | |||
| fixed point w(p) = p, TK loss | : p = 0.378 | |||
| fixed point w(p) = p, Prelec .65: p = 0.368 | ||||
| 1/e = 0.368; largest |TK gain - Prelec fit| = 0.062 | ||||
| fourfold pattern: certainty equivalent CE of (x, p; 0) under the TK medians | ||||
| p | EV gain | CE gain | EV loss | CE loss |
| 0.01 | 1.0 | 3.7 | -1.0 | -2.6 |
| 0.05 | 5.0 | 10.0 | -5.0 | -8.3 |
| 0.50 | 50.0 | 37.4 | -50.0 | -40.8 |
| 0.95 | 95.0 | 76.9 | -95.0 | -83.1 |
| 0.99 | 99.0 | 90.0 | -99.0 | -93.8 |
Key formula
Show the full program
# Value function and probability weighting of cumulative prospect theory.
# Tversky & Kahneman (1992): v(x) = x^a (x >= 0), -lam (-x)^b (x < 0), medians
# a = b = 0.88, lam = 2.25; weighting w(p) = p^g / (p^g + (1 - p)^g)^(1/g),
# g = 0.61 (gains), 0.69 (losses).
# Prelec (1998), a DIFFERENT form: w(p) = exp(-(-ln p)^c); c = 0.65 is the value he uses
# for illustration, not an estimate. We also fit c to TK's gain curve by least squares.
import math
A, B, LAM, GG, GL = 0.88, 0.88, 2.25, 0.61, 0.69
def v(x):
return x ** A if x >= 0 else -LAM * (-x) ** B
def w_tk(p, g):
if p <= 0 or p >= 1:
return float(p >= 1)
return p ** g / (p ** g + (1 - p) ** g) ** (1 / g)
def w_pr(p, c):
return 0.0 if p <= 0 else 1.0 if p >= 1 else math.exp(-(-math.log(p)) ** c)
def fixed_point(f):
lo, hi = 0.01, 0.99 # f(p) - p changes sign once on (0, 1)
for _ in range(60):
mid = (lo + hi) / 2
lo, hi = (mid, hi) if f(mid) > mid else (lo, mid)
return (lo + hi) / 2
grid = [i / 1000 for i in range(1, 1000)]
cfit = min((0.30 + i / 1000 for i in range(701)),
key=lambda c: sum((w_pr(p, c) - w_tk(p, GG)) ** 2 for p in grid))
print(f"v(100) = {v(100):.1f}, v(-100) = {v(-100):.1f};"
f" |v(-x)| / v(x) = {LAM} for every x"
" because a = b")
print(f"Prelec exponent fitted to TK gains (g = 0.61): c = {cfit:.3f}")
print(" p TK gain TK loss Prelec .65 Prelec fit")
for p in (0.001, 0.01, 0.05, 0.1, 0.25, 0.5, 0.75, 0.9, 0.95, 0.99):
print(f" {p:5.3f} {w_tk(p, GG):7.3f} {w_tk(p, GL):7.3f} {w_pr(p, 0.65):10.3f}"
f" {w_pr(p, cfit):10.3f}")
for lab, f in (("TK gain", lambda p: w_tk(p, GG)), ("TK loss", lambda p: w_tk(p, GL)),
("Prelec .65", lambda p: w_pr(p, 0.65))):
print(f" fixed point w(p) = p, {lab:10s}: p = {fixed_point(f):.3f}")
print(f" 1/e = {1 / math.e:.3f}; largest |TK gain - Prelec fit| ="
f" {max(abs(w_tk(p, GG) - w_pr(p, cfit)) for p in grid):.3f}")
print("fourfold pattern: certainty equivalent CE of (x, p; 0) under the TK medians")
print(" p EV gain CE gain EV loss CE loss")
for p in (0.01, 0.05, 0.5, 0.95, 0.99):
ce = []
for x, g in ((100, GG), (-100, GL)):
val = w_tk(p, g) * v(x)
ce.append(val ** (1 / A) if val >= 0 else -((-val / LAM) ** (1 / B)))
print(f" {p:4.2f} {100 * p:8.1f} {ce[0]:8.1f} {-100 * p:8.1f} {ce[1]:8.1f}")Single source and citation
Fan, Y. (2026). Choice Architecture, Cumulative Prospect Theory and Computational Behavioural Economics of Pricing Interfaces (Version 1.0.0), Chapter 3: Cumulative Prospect Theory: Value Functions, Probability Weights and Rank Dependence. 5D Library. https://doi.org/10.5281/zenodo.23836260
DOI: 10.5281/zenodo.23836260 · Read the monograph · 5DL-B-047 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026047,
author = {Fan, Yafu},
title = {Choice Architecture, Cumulative Prospect Theory and Computational Behavioural Economics of Pricing Interfaces},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23836260},
url = {https://doi.org/10.5281/zenodo.23836260}
}Other chapter answers in this book
- Chapter 1 · How Many Options: Choice Overload and the Size of Nudge Effects
- Chapter 2 · Struck-Through and Reference Prices: Transaction Utility, Credibility and Price-Indication Rules
- Chapter 4 · Loss Aversion and Framing: From Individual Choice to a "Conversion Gap"
- Chapter 5 · Decoys and Compromises: Regularity in Discrete-Choice Models and Its Violation
- Chapter 6 · Time: Quasi-Hyperbolic Discounting, Procrastination and the Friction of Forms
- Chapter 7 · Reading the Classics: Weight and Lightness in the *Guanzi* and the Policies of Jiran
- Chapter 8 · Practice and Pre-Registered Testing