4/24/2011Crowdsourcing1 Quantifier Game: Set of Playgrounds Claim: I can go at least as high as you. Claim: I can solve the Highest Safe Rung problem for k jars and q questions for a ladder with n rungs. Can you do it for a ladder with n+1 rungs? Alice Bob HSR

4/24/2011Crowdsourcing2 Quantifier Game: Set of Playgrounds Claim: I can go at least as high as you. Claim: If you give me an x in [0,1] and I give you a y in [0,1]: xy+(1-x)(1-y 2 ) > Can you find a y that so that xy+(1-x)(1-y 2 ) > ? Alice Bob MMG

Definition of M recurrence: M(k,q) = M(k-1,q-1) + M(k,q-1) M(0,q) = 1 M(k,k) = 2 k M(0,q): 0 jars to break M(k,k): k jars to break and q=k questions to ask: use binary search. 1/23/20113Asymptotic Growth

Computing M jars to break: k 0 1 questions asked: q M: maximum number of rungs n rungs: 0,1,2,3, …,n-1 1/23/20114Asymptotic Growth Green: Computed many times! 26:2, 11:3, 15:3 4:4, 7: 6, 8:4

HSR Iterative jars to break: k 0 1 questions asked: q M: maximum number of rungs n rungs: 0,1,2,3, …,n-1 1/23/20115Asymptotic Growth b c 1 b+1 b+1+c