Tutorials › Response-Adaptive Randomization › Play-the-Winner with Three Treatments

Urn Models · Tutorial 46 of 501

Play-the-Winner with Three Treatments

Learn how a three-colour urn changes after each binary response and how those changes determine later treatment-allocation probabilities.

Intermediate 10 min read

What You'll Learn

  • State a three-treatment play-the-winner rule precisely, including what happens to the drawn ball.
  • Calculate the urn composition after success or failure on each treatment.
  • Derive treatment-allocation probabilities from the current colour counts.
  • Calculate the probability of a short allocation-and-response path.
  • Check assumptions and identify common implementation errors.
  • Compare this rule with two-treatment play-the-winner and equal randomization.

Why the Three-Treatment Rule Needs a Precise Update

With two treatments, a play-the-winner rule can respond to failure by reinforcing the one alternative treatment. With three treatments, failure on the assigned treatment leaves two alternatives. A rule must specify how both alternatives are handled; otherwise the urn update, and therefore later allocation probabilities, are ambiguous.

This tutorial uses one direct three-treatment extension of the earlier material on two-treatment play-the-winner: return the drawn ball, reinforce the assigned treatment after success, and reinforce each of the two unassigned treatments after failure. Other multi-treatment rules are possible, so the failure update is part of the rule’s definition rather than something to infer from the name alone.

Definition: Let the three treatments be A, B, and C. Write the urn composition as \((a,b,c)\), where \(a\), \(b\), and \(c\) are the numbers of A-, B-, and C-coloured balls. One ball is drawn uniformly and its colour determines the next participant’s treatment. The drawn ball is returned. If the response is a success, add one more ball of the drawn colour. If the response is a failure, add one ball of each of the two other colours.

This is the one-ball-per-colour play-the-winner rule for three treatments. It is not the only possible three-treatment extension. The rule requires a binary response recorded as success or failure, an assigned treatment identified for each response, and the stated return-and-reinforcement procedure. An initial composition with at least one ball of each colour ensures that every treatment remains available: the rule adds balls but does not remove them.

State Updates and Allocation Probabilities

If the current state is \((a,b,c)\), its total number of balls is \(T=a+b+c\). Because each ball is equally likely to be drawn, the next treatment-allocation probabilities are the colour proportions in the urn. The update depends on both the treatment drawn and the binary response.

Treatment drawnState after successState after failureFailure reinforcements
A\((a+1,b,c)\)\((a,b+1,c+1)\)One B and one C ball
B\((a,b+1,c)\)\((a+1,b,c+1)\)One A and one C ball
C\((a,b,c+1)\)\((a+1,b+1,c)\)One A and one B ball
$$ P(A\text{ next}\mid (a,b,c))=\frac{a}{T},\qquad P(B\text{ next}\mid (a,b,c))=\frac{b}{T},\qquad P(C\text{ next}\mid (a,b,c))=\frac{c}{T}. $$

These probabilities add to one because \(a+b+c=T\). A success adds one ball, so the total increases from \(T\) to \(T+1\). A failure adds two balls, so the total increases from \(T\) to \(T+2\). In either case, the drawn ball is already accounted for in the original composition because it is returned; it is not an additional reinforcement.

Worked Example: Updating After Success and Failure

Suppose the urn starts at \((2,1,1)\). There are four balls, so the next participant has probability \(2/4=0.5\) of assignment to A, \(1/4=0.25\) of assignment to B, and \(1/4=0.25\) of assignment to C.

If B is drawn and the response is a success, return the B ball and add one more B ball. The composition becomes \( (2,1+1,1)=(2,2,1) \). Its total is five, and the next allocation probabilities are \(2/5=0.4\) for A, \(2/5=0.4\) for B, and \(1/5=0.2\) for C.

If instead B is drawn and the response is a failure, return the B ball and add one A ball and one C ball. The composition becomes \( (2+1,1,1+1)=(3,1,2) \). Its total is six, and the next allocation probabilities are \(3/6=0.5\) for A, \(1/6\approx0.1667\) for B, and \(2/6\approx0.3333\) for C.

The failed treatment is not removed: B still has one ball. The failure shifts allocation probability toward both alternatives by adding a ball to each of them.

Transition Probabilities and Response Assumptions

The urn update is deterministic once the drawn treatment and binary response are known. Randomness enters through the draw and, in a response model, through the outcome. To calculate probabilities for a sequence involving responses, one must specify how response probabilities are represented. A common working model assumes each response is Bernoulli with treatment-specific success probability \(\pi_A,\pi_B,\pi_C\), with responses conditionally independent given the assigned treatments. The allocation mechanism itself does not require these probabilities to be equal or known.

For example, from state \((a,b,c)\), the probability of drawing A and then observing a success is \(\frac{a}{T}\pi_A\) under that model. The state then becomes \((a+1,b,c)\). The probability of drawing A and observing a failure is \(\frac{a}{T}(1-\pi_A)\), and the state becomes \((a,b+1,c+1)\). These are probabilities for the combined draw-and-response event; the update table alone does not specify the clinical response probabilities.

Assumptions for response-path calculations: Each participant receives the treatment indicated by the draw; the outcome is classified as success or failure before the next draw; and the response probabilities used in a calculation correctly describe the process. The simple treatment-specific model assumes a stable success probability for each treatment and conditional independence across participants. If outcomes are delayed, depend on earlier participants, or are not binary, the update rule or the probability calculation must be adapted explicitly.

Worked Example: Probability of a Short Allocation-and-Response Path

Assume the initial urn is \((1,1,1)\), and use the response model \(\pi_A=0.7\), \(\pi_B=0.5\), and \(\pi_C=0.4\). Find the probability of this path: the first participant is assigned A and succeeds; the second is assigned C and fails; the third is assigned B. No response is specified for the third participant.

Initially, each treatment has probability \(1/3\). After A succeeds, the state is \((2,1,1)\), with total four. The probability of assigning C next is \(1/4\). After C fails, add one A and one B ball; the state is \((3,2,1)\), with total six. The probability of assigning B third is therefore \(2/6=1/3\).

By conditional multiplication, the requested joint path probability is

$$ \frac{1}{3}(0.7)\frac{1}{4}(1-0.4)\frac{2}{6} =\frac{1}{3}(0.7)\frac{1}{4}(0.6)\frac{1}{3} =0.01167. $$

Thus the path has probability approximately 0.01167, or 1.167%, under the stated response model and urn rule. The factor for the third draw uses the state after the second participant’s failure; using the initial state or the state after A’s success would give the wrong probability.

Short Justification of the Transition Probabilities

The transition probabilities follow directly from the random draw and the response model. For a current state \((a,b,c)\), the events “draw A,” “draw B,” and “draw C” are mutually exclusive and exhaustive. Their probabilities are \(a/T\), \(b/T\), and \(c/T\). Conditional on drawing A, success has probability \(\pi_A\) and failure has probability \(1-\pi_A\). Therefore the probabilities of the two A-related transitions are

$$ P\big((a,b,c)\to(a+1,b,c)\big)=\frac{a}{T}\pi_A, \qquad P\big((a,b,c)\to(a,b+1,c+1)\big)=\frac{a}{T}(1-\pi_A). $$

The two probabilities sum to \(a/T\), the probability of drawing A. Applying the same argument to B and C gives all six possible draw-and-response transitions. Their total probability is \(\frac{a}{T}+\frac{b}{T}+\frac{c}{T}=1\), so the transition probabilities account for every possible next event. This calculation relies on the binary outcome classification and on using the appropriate response probability for the treatment drawn.

Worked Example: Failure on C and the Next Allocation

Suppose the current composition is \((3,2,1)\). The total is six, so the probability of drawing C is \(1/6\). If C is drawn and the response is a failure, add one A ball and one B ball while returning the drawn C ball. The new composition is \( (3+1,2+1,1)=(4,3,1) \), with total eight.

The next allocation probabilities are therefore \(4/8=0.5\) for A, \(3/8=0.375\) for B, and \(1/8=0.125\) for C. If the success probability on C is \(\pi_C=0.4\), then the probability that the current draw is C and produces a failure is \( (1/6)(1-0.4)=(1/6)(0.6)=0.1 \).

This \(0.1\) is the probability of drawing C and observing a failure at this step. The allocation probabilities \(0.5, 0.375, 0.125\) describe the following draw, conditional on that update having occurred.

How the Rule Differs From Alternatives

The two-treatment play-the-winner rule reinforces the assigned treatment after success and the other treatment after failure. In the three-treatment rule here, a failure reinforces both alternatives, because there are two of them. This extension preserves the basic “success favours the assigned treatment; failure favours alternatives” idea, but it does not make the same-sized update after success and failure: a success adds one ball, whereas a failure adds two.

Under equal randomization, each treatment would instead be assigned with probability \(1/3\) at every step, regardless of earlier responses. The urn rule is response-adaptive: prior assignments and outcomes change the composition, which can change subsequent probabilities. This change is a feature of the allocation mechanism, not evidence by itself that one treatment is more effective. A response observed in a small sample can alter later allocations even when treatment response probabilities are identical.

The rule also differs from any procedure that, after failure, adds a ball to only one alternative or removes a ball of the failed treatment. Such procedures produce different states and probabilities. A protocol or implementation must say exactly which update is used, including whether the drawn ball is returned and how many balls are added.

Diagnostics, Limitations, and Common Mistakes

A useful audit records the composition before each assignment, the colour drawn, the binary outcome, and the resulting composition. At each step, check that the draw probabilities are nonnegative and sum to one, that the update matches the assigned treatment and response, and that the total rises by one after success or by two after failure. With all three initial counts positive, none should become zero under this add-only rule.

  • Updating before returning the drawn ball. The drawn ball is returned in this rule. Treating it as removed changes both the next composition and the allocation probabilities.
  • Adding only one alternative after a three-treatment failure. The rule defined here adds one ball to each of the two alternatives. Adding to only one is a different procedure.
  • Reinforcing the failed treatment. A failure on B adds A and C balls, not another B ball. The B ball drawn is simply returned.
  • Using the wrong denominator. Allocation probabilities use the current total after the most recent update, not the starting total or the previous state’s total.
  • Treating adaptation as proof of benefit. More balls of one colour mean a larger probability of assignment under this rule; they do not establish that treatment has a higher success probability.

The rule is simple but has limitations. Because failures add two balls and successes add one, the total urn size depends on the observed response history. Randomization probabilities can become quite unequal after a sequence of outcomes, and early chance outcomes can affect later allocations. The rule also presumes that the recorded response is available in time for the next update. It does not, by itself, address delayed responses, competing outcomes, changing treatment effects, or how treatment comparisons should be analyzed.

Key takeaway: For this three-treatment play-the-winner rule, return the drawn ball; after success add one ball of that treatment, and after failure add one ball of each other treatment. Then calculate the next allocation probabilities from the updated colour counts.

Check Your Understanding

For each problem, use the one-ball-per-colour rule defined above. Solutions are provided after the questions.

  1. From state \((2,3,1)\), treatment A is drawn and the response is a failure. What is the new state and the next allocation probability for each treatment?
  2. From state \((1,2,2)\), what is the probability of drawing B and observing a success if \(\pi_B=0.6\)? What state follows that event?
  3. Explain why the total urn size changes by different amounts after success and failure.
  4. A student says, “After a failure on C, remove the C ball and add one A ball.” Identify the error and give the correct update from state \((2,1,3)\).

Solutions. 1. Failure on A adds one B and one C ball, giving \((2,4,2)\), total eight. The next probabilities are \(2/8=0.25\) for A, \(4/8=0.5\) for B, and \(2/8=0.25\) for C. 2. The probability is \((2/5)(0.6)=0.24\), since B has two of the five balls. Success returns the drawn B ball and adds one B ball, giving \((1,3,2)\). 3. The drawn ball is returned in both cases. Success adds one reinforcement ball, while failure adds one ball for each of two alternative treatments, so the total increases by one or two, respectively. 4. The proposed update removes the drawn ball and reinforces only one alternative, neither of which follows this rule. Return the C ball and add one A and one B ball: \((2,1,3)\) becomes \((3,2,3)\).

Clinical Biostats