Mon, February 25, 2019
Public Access

Category:
Category: All

25
February 2019
Mon Tue Wed Thu Fri Sat Sun
        1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28      
8:00am  
9:00am  
10:00am  
11:00am  
12:00pm  
1:00pm  
2:00pm  
3:00pm [3:00pm] Yuval Filmus, Technion, Haifa, Israel
Description:
Combinatorics and Theoretical Computer Science seminar. Speaker: Yuval Filmus. Affiliation: Technion, Haifa, Israel. Date and Time: Monday 25 February, 3.00pm - 4.00pm. Venue: Ramanujan Hall, Mathematics Department, IIT Bombay. Title: Twenty Questions: Distributional Search Theory. Abstract: I’m thinking of a person in the audience. How long will it take you to find whom, using only Yes/No questions? We consider this puzzle, which underlies search theory, with a twist: I’m choosing the person according to a known distribution, and your goal is to minimize the expected number of questions. How does the performance of your strategy depend on the type of question you’re allowed to ask? On the type of distribution I am allowed to choose? What happens if I can lie? Joint work with Yuval Dagan (MIT), Ariel Gabizon (Zcash), Daniel Kane(UCSD), Shay Moran (IAS).
4:00pm  
5:00pm  
6:00pm