20 citations · 115 across the 34 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016
Trading information complexity for error
Yuval Dagan, Yuval Filmus, Hamed Hatami +1
We consider the standard two-party communication model. The central problem studied in this article is how much one can save in information complexity by allowing an error of .…
cs.DM2016
Twenty (simple) questions
Yuval Dagan, Yuval Filmus, Ariel Gabizon +1
A basic combinatorial interpretation of Shannon's entropy function is via the "20 questions" game. This cooperative game is played by two players, Alice and Bob: Alice picks a dist…