Skip to content

Expected Payoff Maximization


Definition

In a decision problem under uncertainty, each action a∈Aa\in A induces a probability distribution (a lottery) over the outcome set XX, and the decision maker has a payoff v(x)v(x) for each outcome x∈Xx\in X.

  • If X={x1,…,xm}X=\{x_1,\ldots,x_m\} is finite, action aa gives outcome xkx_k with probability p(xk∣a)≥0p(x_k\mid a)\ge0, where ∑kp(xk∣a)=1\displaystyle \sum_{k}p(x_k\mid a)=1.
  • If outcomes are continuous, action aa induces a density f(x∣a)f(x\mid a).

Assume each action has a finite expected absolute payoff; in the continuous case this means ∫−∞∞∣v(x)∣f(x∣a) dx<∞\int_{-\infty}^{\infty}|v(x)|f(x\mid a)\,\mathrm{d}x<\infty. The expected payoff of action aa is

E[v(x)∣a]=∑k=1mp(xk∣a) v(xk)orE[v(x)∣a]=∫−∞∞v(x) f(x∣a) dx,\mathbb{E}[v(x)\mid a]=\sum_{k=1}^{m}p(x_k\mid a)\,v(x_k)\quad\text{or}\quad \mathbb{E}[v(x)\mid a]=\int_{-\infty}^{\infty}v(x)\,f(x\mid a)\,\mathrm{d}x,

and expected payoff maximization means choosing a∗∈arg⁡max⁡a∈AE[v(x)∣a]a^*\in\arg\max_{a\in A}\mathbb{E}[v(x)\mid a]. A rational agent facing uncertainty is assumed to behave in this way.


Interpretation

The action does not fix the outcome; it changes the distribution of outcomes. The decision maker compares actions through the expectation of the payoff, computed from the probability mass function p(⋅∣a)p(\cdot\mid a) or the probability density function f(⋅∣a)f(\cdot\mid a). Computing E[v(x)∣a]\mathbb{E}[v(x)\mid a] from the distribution of xx, without first finding the distribution of v(x)v(x), is LOTUS, in the discrete and the continuous case alike.

Decision tree in which Safe leads to 10 for sure and Risky to 30 or 0 with probabilities 0.4 and 0.6, beside each action's expected payoff for v(x)=x and v(x)=√x.

The figure draws Example 1. Each action leads to a chance node, that is, to a lottery over outcomes: Safe gives x=10x=10 with probability 11, Risky gives 3030 or 00 with probabilities 0.40.4 and 0.60.6. The columns on the right are E[v(x)∣a]\mathbb{E}[v(x)\mid a] for two payoff functions, with the larger value in each column shaded: with v(x)=xv(x)=x Risky is chosen (12>1012>10), with v(x)=xv(x)=\sqrt x Safe is chosen (3.162>2.1913.162>2.191).

Here the payoff values are cardinal: differences between payoffs matter, not only their order. A common misunderstanding is that the rule means maximizing expected money. That holds only when v(x)=xv(x)=x. If vv is a strictly concave utility of money, the same rule is maximization of expected utility and describes a risk-averse decision maker (see expected utility and risk aversion).

In games, the uncertainty often comes from the other players: a belief about their choices plays the role of p(⋅∣a)p(\cdot\mid a), and from Week 2 a mixed strategy creates such uncertainty deliberately.


Key Results

  • The expected payoff is linear in the probabilities: for a compound lottery that runs lottery L1L_1 with probability λ\lambda and L2L_2 with probability 1−λ1-\lambda, the expected payoff is λ EL1[v]+(1−λ) EL2[v]\lambda\,\mathbb{E}_{L_1}[v]+(1-\lambda)\,\mathbb{E}_{L_2}[v].
  • Replacing vv by αv+β\alpha v+\beta with α>0\alpha>0 leaves the ranking of actions unchanged; a nonlinear strictly increasing transformation can reverse it (Example 1).
  • If AA is finite and nonempty, a maximizing action exists under the finite-expected-payoff assumption above.
  • With finitely many outcomes, the expected payoff of an action lies between the smallest and the largest payoff among the outcomes it can produce; in general it cannot exceed any upper bound, or fall below any lower bound, that holds for every payoff the action can produce.
  • If every action leads to a single outcome with probability 11, the rule reduces to choice under certainty.

Examples

1. Safe or risky. Action Safe pays 1010 for sure. Action Risky pays 3030 with probability 0.40.4 and 00 with probability 0.60.6. With v(x)=xv(x)=x,

E[v∣Safe]=10,E[v∣Risky]=0.4⋅30+0.6⋅0=12,\mathbb{E}[v\mid\text{Safe}]=10,\qquad \mathbb{E}[v\mid\text{Risky}]=0.4\cdot30+0.6\cdot0=12,

so Risky is chosen. With v(x)=xv(x)=\sqrt x instead, 10≈3.162\sqrt{10}\approx3.162 against 0.430≈2.1910.4\sqrt{30}\approx2.191, so Safe is chosen: the ranking depends on the payoff scale, not only on the order of outcomes.

2. Continuous outcomes. Under action a1a_1 the outcome has the uniform distribution on [0,20][0,20], so f(x∣a1)=1/20f(x\mid a_1)=1/20 and E[x∣a1]=10\mathbb{E}[x\mid a_1]=10. Under a2a_2 the density is f(x∣a2)=x/200f(x\mid a_2)=x/200 on [0,20][0,20] (it integrates to 400/400=1400/400=1), so

E[x∣a2]=∫020x⋅x200 dx=203600=403≈13.33.\mathbb{E}[x\mid a_2]=\int_0^{20}x\cdot\frac{x}{200}\,\mathrm{d}x =\frac{20^3}{600}=\frac{40}{3}\approx13.33.

With v(x)=xv(x)=x the decision maker chooses a2a_2, which shifts probability towards high outcomes.


Prerequisites



Sources

Aliases: maximizing expected payoff, expected value criterion, Expected Payoff Maximisation Keywords: decision under uncertainty, lottery, p(x|a), f(x|a), E[v(x)|a], risk neutral Symbols: alpha, beta, element of, infinity, integral, lambda, square root, sum

Last updated: 27 October 2026 11:52