Video, warmup problems and slides for Amin Aminzadeh Gohari’s course
Photo by Kelly Sikkema on Unsplash

Video, warmup problems and slides for Amin Aminzadeh Gohari’s course

You need to be logged in to see this post.

Here are the slides of the talk.


Here is the video of the lecture:

Amin Gohari

Amin Aminzadeh Gohari received his B.Sc. degree from Sharif University, Iran, in 2004 and his Ph.D. degree in electrical engineering from the University of California, Berkeley in 2010. He was a postdoc at the Chinese University of Hong Kong, Institute of Network Coding. Dr. Aminzadeh Gohari received the 2010 Eli Jury Award from UC Berkeley, Department of Electrical Engineering and Computer Sciences, for “outstanding achievement in the area of communication networks,” and the 2009-2010 Bernard Friedman Memorial Prize in Applied Mathematics from UC Berkeley, Department of Mathematics, for “demonstrated ability to do research in applied mathematics.” He also received the Gold Medal from the 41st International Mathematical Olympiad (IMO 2000) and the First Prize from the 9th International Mathematical Competition for University Students (IMC 2002). He was selected as an exemplary reviewer for the IEEE Transactions on Communications in 2016 and 2017. Dr. Gohari is currently serving as an Associate Editor for the IEEE Transactions on Information Theory.

This Post Has 6 Comments

  1. Hoang

    I don’t understand problem 4. Is there literally any way the 3 players can communicate with each other?

    1. Daniel

      Gohari’s response: the players cannot communicate in any way after the game started, i.e., they cannot reveal the color of other player’s hats to them. A trivial strategy is for everyone to randomly guess the color of their own hat, and this yields a winning probability of 1/8. However, the players can do a lot better than that, without explicitly communicating their information. That’s the puzzle.

  2. Art

    I want to ask something about the Egg problem. I don’t understand how the eggs can be fragile (so they will if they’re dropped from the 1st floor) and they can be very hard (they won’t break if they’re dropped from the 100th floor). Should there be the opposite; they’ll break if dropped from the 100th floor and they won’t break if dropped from the 1st floor. By assuming the problem condition, we have that the 100th floor is the highest floor the egg won’t break if dropped.

    1. José de Jesús

      I think that part of the problem is trying to say that we don’t know the highest floor of the building from which
      an egg can be dropped without breaking, but that it is a fixed value that we want to find. You could omit that sentence and maybe the problem would be more clear.

    2. Amin Gohari

      As Jose said, the problem just says that we do not know the highest floor where the egg can be dropped without breaking. This floor is unknown. It may be that the egg breaks if you drop it from the first floor. Or the egg might not even break if you drop it from the 100th floor. With only one egg, you can just start dropping the egg on floor 1 and go up until you’ve reached the correct floor. But it may take you 100 drops in the worst case to find the correct floor. With two eggs, you can reduce the number of drops significantly.

      1. Art

        Thank you very much both, mr. Jose and prof. Amin. I sure misunderstood the problem. I’m very sorry for my English. I have to apologize! 🙂

Leave a Reply