CSCE 411 Lecture 28

From Notes
Jump to navigation Jump to search
Lecture Slides

« previous | Friday, November 2, 2012 | next »


The Birthday Paradox

Suppose that there are n possible birthdays (in our case, n=365) and k people in a room. How likely is it that two of the k people have the same birthday?

Assume that birthdays are uniformly and independently distributed over N={1,,n}.

If person a has a birthday baN, then (b1,,bk) are all of the birthdays of all people in the room.

Thus the event (b1,,bk) has probability 1nk

Let us calculate the probability q of the event that all k people have a different birthday. We are interested in the complementary event where 2 or more people share the same birthday: p=1q

Suppose that E is the subset of vectors in Nk that have distinct entries.

|E|=n(n1)(nk+1)=i=0k1(ni)q=|E|nk=1nki=0k1(ni)=i=1k1(1in)p=1q=1i=1k1(nin)

Recall that 1+xex holds for all real numbers. Hence

qi=1k1ein=exp(i=1k1in)=exp(k(k1)2n)

Let's estimate the probability that q12.

qexp(k(k1)2n)12

This is the case where

k12(1+1+8nlog2)

Since k(k1)=14(8nlog2)

This is surprisingly often.


The Hat Game

n players, each of them assigned a red or blue hat at random.

Players simultaneously guess the colors of their own hats. Passing is allowed.

At least one correct guess and no incorrect guesses leads to a WIN!

  • A player gets no information about his own hat from looking at his teammates hats
  • No strategy can guarantee victory

Easy strategy: 1 person guesses, everyone else passes

Better Strategy

For n = 3, if you see two different colors, say the other color. If you see two different colors, pass.

configuration Guesses
BBB RRR
BBR PPR
BRB PRP
BRR BPP
RBB RPP
RBR PBP
RRB PPB
RRR BBB

Probability of success is now 75%

However, there were 6 correct and 6 incorrect guesses (higher concentration of incorrectness in the edge cases).