Why the Reward Objective Matters
A sequential treatment-allocation policy assigns each arriving patient using information available at that time. The policy affects not only which treatment each patient receives, but also the sequence of rewards generated across patients. A policy can give more reward early and less later, or sacrifice early reward to improve later outcomes. To compare such policies, we must specify how rewards across time are combined.
Three common summaries answer different questions: the total reward over a fixed number of patients, a discounted total that gives earlier rewards greater weight, and the long-run average reward per patient. These are not interchangeable descriptions of a policy. The appropriate objective depends on the clinical and operational question, including whether the trial has a fixed endpoint and how outcomes at different times should count.
Allocation and Reward Notation
Suppose there are \(K\) available treatments. At patient \(t\), let \(A_t\) denote the assigned treatment and \(R_t\) the resulting reward, defined so that larger values represent more desirable outcomes. Let \(H_{t-1}\) denote the information available before assigning patient \(t\). A randomized policy may choose treatment \(a\) with probability \(P(A_t=a\mid H_{t-1})\). The policy is adaptive when these probabilities can depend on the observed history.
For the basic comparisons here, assume rewards have finite means and are bounded in absolute value by a constant \(M\): \(|R_t|\leq M\). This condition guarantees that the discounted infinite sum below is finite when the discount factor is less than one. Examples use specified expected rewards; their arithmetic concerns those expectations, not claims that every patient's observed outcome equals its mean.
A finite-horizon objective explicitly depends on the chosen endpoint \(T\). A discounted objective assigns weight \(1\) to the first reward, \(\gamma\) to the second, and \(\gamma^{t-1}\) to the reward at time \(t\). When \(\gamma=0\), only the first reward contributes. As \(\gamma\) approaches one, later rewards receive more weight. The average-reward objective instead asks about the asymptotic expected reward rate; it does not give a lasting advantage to a fixed number of unusually good early outcomes.
Discounted Reward: Meaning and Convergence
The discount factor is a modeling choice, not an estimated treatment effect. It can represent a decision-maker's preference for earlier benefit, limited relevance of distant outcomes, or an approximation to a finite planning horizon. In a clinical setting, discounting patient rewards requires a substantive justification: it should not be introduced merely because a mathematical objective is convenient.
Under the bound \(|R_t|\leq M\), the absolute value of the discounted tail after period \(L\) is at most \(M\sum_{t=L+1}^{\infty}\gamma^{t-1}\). For \(0\leq\gamma<1\), this geometric series yields the following useful justification.
Thus, the influence of sufficiently distant rewards can be bounded, and the infinite discounted sum converges. The bound also helps assess whether a finite calculation is an adequate approximation: it gives a conservative maximum omitted tail, not the actual tail value. If rewards are not bounded, convergence instead requires suitable conditions on their magnitudes; the bounded-reward assumption avoids that complication here.
Sometimes the discounted total is reported in normalized form, \((1-\gamma)J_\gamma(\pi)\). This rescales the objective and can make its magnitude comparable to a reward per period, especially when rewards are stable over time. For a fixed \(\gamma\), multiplying every policy's objective by the same positive constant does not change their ranking. The normalized quantity is still a discounted summary, not automatically the same as the long-run average reward.
Worked Example: Computing a Discounted Total
Consider a hypothetical policy whose expected rewards for the first four patients are 10, 6, 6, and 6 reward units. Suppose the expected reward remains 6 units for every later patient and use \(\gamma=0.8\). The reward sequence is bounded, and the geometric tail converges because \(0.8<1\).
The discounted expected total is
The first term is 10. From patient 2 onward, the expected reward is always 6, so the remaining terms form a geometric series:
For comparison, a policy yielding 7 expected reward units at every patient has \(J_{0.8}=7/(1-0.8)=35\) reward units. Under this discount factor, the constant-7 policy has the greater discounted total, although the first policy gives a larger expected reward to the first patient. The conclusion applies to the stated reward sequences and \(\gamma\), not to policies in general.
Long-Run Average Reward
The average-reward objective is appropriate when the main question concerns performance per patient over a continuing or very long allocation process. Its definition uses a limit inferior so that it remains defined even when the sequence of expected averages does not converge. If the ordinary limit exists, the limit inferior equals that limit. For a finite trial, however, the long-run objective is a limiting criterion, not a substitute for calculating the actual expected total over the trial's planned enrollment.
A simple special case clarifies the interpretation. If a policy has the same expected reward \(c\) for every patient, then \(E_\pi[S_T^\pi]=Tc\), and therefore \(g(\pi)=\lim_{T\to\infty}Tc/T=c\). More generally, the average depends on the whole expected reward sequence, but a finite early advantage is divided by an increasingly large \(T\) and vanishes in the long-run rate.
Worked Example: A Transient Advantage Versus a Persistent Reward
Compare two hypothetical policies. Policy P has expected reward 10 units for each of the first three patients and 0 units thereafter. Policy Q has expected reward 6 units for every patient. The expectations are assumed to describe the sequences under the policies; no claim about a particular clinical treatment's actual effects is being made.
Over the first three patients, the expected cumulative rewards are
Thus, for a fixed horizon of three patients, P is preferable by 12 reward units. But for any \(T>3\), P's cumulative expected reward remains 30, while Q's is \(6T\). Their expected average rewards are
Consequently, \(g(P)=0\) and \(g(Q)=6\) reward units per patient. The fixed three-patient total favors P, while the long-run average favors Q. The reversal follows from the different time ranges each objective summarizes.
Comparing the Objectives
The following table summarizes the interpretation of each objective. The word “best” is always relative to the chosen reward definition, horizon, and policy set.
| Objective | Time weighting | Question answered | Important limitation |
|---|---|---|---|
| Finite-horizon total \(E[S_T^\pi]\) | Each of the first \(T\) rewards has equal weight; later rewards are excluded. | Which policy gives the greater expected total over this specified enrollment? | Its comparison can change when \(T\) changes. |
| Discounted total \(J_\gamma(\pi)\) | Reward at time \(t\) has weight \(\gamma^{t-1}\). | Which policy has the greater weighted cumulative reward under this discounting scheme? | The value of \(\gamma\) embodies a substantive weighting choice. |
| Long-run average \(g(\pi)\) | Evaluates expected reward per patient as the horizon grows. | Which policy has the greater asymptotic expected reward rate? | It can ignore meaningful finite-trial differences and may not describe a short trial. |
A comparison should use the same reward scale and a clearly stated time horizon or discount factor for all candidate policies. If one policy's expected reward sequence is at least as large as another's at every time point, all three objectives rank it at least as highly, provided the objectives are well-defined. When the sequences cross, rankings can differ, as in the preceding example.
Worked Example: Discounting Can Change a Finite-Horizon Ranking
Consider two hypothetical expected reward sequences over four patients. Policy U yields 12, 0, 0, and 0 units. Policy V yields 5, 5, 5, and 5 units. A finite-horizon comparison over four patients gives
Thus V has the greater four-patient total, by 8 units. Now use \(\gamma=0.5\). The discounted totals over these four rewards are
On this discounted four-patient calculation, U is greater by \(12-9.375=2.625\) reward units. This is not the infinite-horizon discounted objective unless rewards after patient 4 are specified. If both policies yield zero thereafter, these totals are also their infinite discounted totals; otherwise the omitted tails must be added. This example shows both that discounting can alter a ranking and that a calculation must state whether it is finite or infinite.
Assumptions, Diagnostics, and Common Mistakes
The definitions themselves require a specified reward and time index. The convergence argument for an infinite discounted total additionally used bounded rewards and \(0\leq\gamma<1\). Interpreting the average as a stable long-run rate is clearest when the process has a continuing meaning and its expected averages settle; the limit-inferior definition does not require that they settle, but a single rate may then conceal important variation.
- Check the reward definition. Confirm that larger values genuinely mean better outcomes and that units are consistent across patients and treatments. If rewards combine several outcomes, the combination determines what is being optimized.
- Check the time weighting. State the finite horizon or \(\gamma\), and explain why it represents the decision. A large change in the ranking under plausible choices of \(\gamma\) is a warning that conclusions depend on the weighting convention.
- Check the tail. For an infinite discounted calculation, use a bound such as \(M\gamma^L/(1-\gamma)\) when rewards are bounded. Do not silently treat a truncated sum as the full discounted objective.
- Check the time scale. An average over an indefinitely long process may be a poor description of a trial expected to stop after a fixed number of patients. Conversely, a short fixed horizon may fail to capture sustained performance.
A common mistake is to say, “The policy with the highest average reward must be best, so it should also be preferred for this trial.” That reasoning confuses a limiting per-patient rate with a finite-horizon total. In the transient-advantage example, P has the higher three-patient total, but Q has the higher long-run average. The correction is to identify the decision question first, compute the matching objective, and report the horizon or discounting used.
These objectives evaluate reward, not every feature of a clinical trial. A policy with a high expected reward under the chosen definition need not be acceptable if it violates safety or allocation constraints, and a reward objective alone does not describe the quality of treatment-effect estimation. Those considerations require explicit criteria alongside, or instead of, reward maximization.
Check Your Understanding
Answer each question using the objective definitions above. Short solutions follow the questions.
- A policy has expected reward 4 units for every patient. What is its long-run average reward?
- For \(\gamma=0.5\), what weights are assigned to rewards at patients 1, 2, and 4?
- Why does the infinite discounted sum converge under \(|R_t|\leq M\) when \(0\leq\gamma<1\)?
- Policy A has expected rewards 9, 9, 0, 0 over four patients. Policy B has expected rewards 5, 5, 5, 5. Which policy has the larger four-patient total?
- Give one reason a long-run average may be a poor sole criterion for a short clinical trial.
Solutions. 1. Since \(E[S_T]=4T\), \(g=\lim_{T\to\infty}4T/T=4\) reward units per patient. 2. The weights are \(1\), \(0.5\), and \((0.5)^3=0.125\), respectively. 3. The absolute discounted sum is bounded by \(M\sum_{t=1}^{\infty}\gamma^{t-1}=M/(1-\gamma)\), which is finite. 4. A totals \(9+9+0+0=18\) units; B totals \(5+5+5+5=20\) units, so B is larger by 2 units. 5. A limiting rate can ignore an important early benefit or other differences within the trial's actual fixed enrollment.