# Interpreting Drew Carey

If we’ve decided that at the significance level we find comfortable there are too few clean sweeps of any position in Contestants Row, the natural question is why there are so few. We estimated there should have been six clean sweeps, based on modelling clean-sweep occurrences as a binomial distribution. Something in the model went wrong. Let’s try to reason out what it was.

One assumption for a binomial distribution are that we have some trial, some event, which happens many times. Each episodes is the obvious trial here. The outcome we’re interested in seeing has some probability of happening on each trial; there is indeed some probability of a clean sweep each episode. The binomial distribution assumes that this probability is constant for every trial, that it doesn’t become more or less likely the tenth or hundredth or thousandth time around, and this seems likely to hold for The Price Is Right episodes. Granted there is some chance of a clean sweep in one episode; what could be done to increase or decrease the likelihood from episode to episode?

That does suggest a possibility, actually: maybe contestants get better with time. Contestants who’ve seen a particular item come up for bid before can use that knowledge to make a better bid again. Most long-running game shows see the contestants getting better, since contestants tend to be fans and they learn how to play, both faster — in the Chuck Woolery days Wheel of Fortune used to rarely get to a fourth word puzzle during the day; today it averages around seventy completed puzzles per half-hour (admittedly, Woolery’s era lost time to shopping for prizes) — and better, learning strategy from watching other successful contestants (there’s a reason the Wheel of Fortune bonus round just gives every contestant the letters R-S-T-L-N and E). However, it’s hard to see how improved quality of contestants could affect whether one seat gets all the winning bidders. On average each contestant, in each seat, should get better by about the same amount (assuming they do; some weeks, one wonders if contestants do learn). So the probability of a clean sweep in any particular show is probably reasonably constant.

We’ve got the number of hourlong episodes right. Perhaps Drew Carey was simply wrong when he said there had been only one clean sweep before. He wasn’t acting as an archivist, after all, or accountant; his job is to make each show exciting and seeing a rare event is exciting. Bob Barker was — notorious may be literally the correct word, but it sounds ridiculous in this context — reliable, then, for claiming events to be unprecedented when the faithful watcher could determine they were not. And possibly Drew Carey meant to say there had only been one clean sweep while he was hosting; he’s hosted for fewer than a thousand shows, but this would be quite reasonably likely enough. This is a tolerably likely explanation.

But there is also another credible explanation. We supposed — well, I supposed, and only one person spoke up to question this — the chance of all six contestants coming from the same seat would be about one in 1,000, based on the assumption that each of the four seats was equally likely to win each of the six items up for bid. But what if they’re not equally likely? The goal of the item-up-for-bid part is to bid as close as possible to an item’s actual retail price without going over. That’s always going to be won by the person who can name the price exactly right, which could be anyone, but few people manage that. So if nobody knows the exact price, there is an advantage given to the last bidder: she or he can pick whatever sounds like the best of the three given bids, and bid a dollar over that, or bid one dollar if they all sound high, and secure a win. There is, plausibly, an advantage given to the last bidder — which is never the same seat as whoever won the last time around. (Further, a contestant who’s been through several bids can hear if someone else in the audience is reliably correct, which is permitted in the game; the one perfect bid in Showcase history was given by a contestant who paid attention the person in the audience who had memorized the prices of likely prizes.)

In this interpretation, the chance of a clean sweep is less than one in 1,000. It’s hard to guess just what it should be, but it wouldn’t surprise me if it turns out to be one in 6,000. From that we could estimate just how much less likely the first bidder is to win an item up for bid, compared to later bidders.

This may all seem like I’ve taken close to ten thousand words to explain what is obvious: it’s better to be the last bidder in Contestants Row. So I have. But now we have close to five thousand words of justification for that obvious conclusion.

## Author: Joseph Nebus

I was born 198 years to the day after Johnny Appleseed. The differences between us do not end there. He/him.

## 10 thoughts on “Interpreting Drew Carey”

1. Chiaroscuro says:

And I didn’t want to interrupt.

Of course, we might estimate how much more likely the advantage given to the last bidder is- let’s say it’s roughly 31% over time (Figuring it could raise to a rough 1/3, but there’s exact bids, and \$1 bids which are sometimes too low, which might lower it from that). Making the big assumption that the other three bidders have a roughly equal chance as well (Which is also a big assumption, given that the second bidder knows the first bid, the third knows the first and second, but it’s pretty good for me) Then we’ve got the last seat at 31%, and the other three seats at 23%.. From THERE we’d have to solve for the odds of a clean sweep in one show, and see where that lies, and I suspect that’s enough to throw the odds just towards harder enough to make it a bit more towards 1 in 6,000.

But I’m not going to do that math, offhand.

Like

1. I’m not sure that, with the given information, there’s really a way to say how much of an advantage the last bidder gets over the ones who go first. We can come up with decent reasons to think it’s one thing or another, but I think the limits of calculation on this data, the one clean sweep in 6,000 shows, are estimating how big a disadvantage the person going first has.

Of course, someone tracking every episode to see which number bidder — first, second, third or fourth — as opposed to which seat could probably make a pretty good estimate within a couple of months.

Like

1. Chiaroscuro says:

A very rough calculation would lead to one in six thousand being the expected result of each round, the person winning being the first bidder is 17.6%. (A 20% chance would yield one in 3,125.) You are correct though in that it does not matter what breaks a clean sweep for this- if the second, third, or fourth bidder wins the item up for bid, that breaks the clean sweep. It doesn’t matter which has the higher advantages, just how low the first bidder’s is.

(To note, my original estimate of 23% put the odds at one in 1,555.)

Like

1. You’ve got just the right calculation, yes, and I make it out to be the same estimate.

Like

2. I miss when they used to shop for prizes. Everyone remembers the dalmatian statue that was almost always in the prize showcase, but there was an end table shaped like an elephant that recurred often and which I liked as a kid.

Like

1. I miss the shopping for prizes too, even if they did bring the flow of gameplay to a stop. (I suppose I might search YouTube for ancient episodes to see what I think of the pacing now.) Between all the special spots on the wheel and the toss-up puzzles it can be hard spotting the clean lines of the original game underneath all the cruft now.

Like

This site uses Akismet to reduce spam. Learn how your comment data is processed.