Expected Payoff Maximization¶
Definition¶
In a decision problem under uncertainty, each action induces a probability distribution (a lottery) over the outcome set , and the decision maker has a payoff for each outcome .
- If is finite, action gives outcome with probability , where .
- If outcomes are continuous, action induces a density .
Assume each action has a finite expected absolute payoff; in the continuous case this means . The expected payoff of action is
and expected payoff maximization means choosing . 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 or the probability density function . Computing from the distribution of , without first finding the distribution of , is LOTUS, in the discrete and the continuous case alike.
The figure draws Example 1. Each action leads to a chance node, that is, to a lottery over outcomes: Safe gives with probability , Risky gives or with probabilities and . The columns on the right are for two payoff functions, with the larger value in each column shaded: with Risky is chosen (), with Safe is chosen ().
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 . If 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 , 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 with probability and with probability , the expected payoff is .
- Replacing by with leaves the ranking of actions unchanged; a nonlinear strictly increasing transformation can reverse it (Example 1).
- If 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 , the rule reduces to choice under certainty.
Examples¶
1. Safe or risky. Action Safe pays for sure. Action Risky pays with probability and with probability . With ,
so Risky is chosen. With instead, against , so Safe is chosen: the ranking depends on the payoff scale, not only on the order of outcomes.
2. Continuous outcomes. Under action the outcome has the uniform distribution on , so and . Under the density is on (it integrates to ), so
With the decision maker chooses , which shifts probability towards high outcomes.
Prerequisites¶
Related Concepts¶
Sources¶
- Game Theory · Week 1
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
Expected Payoff MaximizationIndifference Principle for Mixed StrategiesMixed StrategyRational AgentExpectationProbability Mass FunctionProbability Density FunctionExpected Utility and Risk AversionBest Response