Publication
Robust Incentives via Multi-level Tit-for-tat
Video
A Combinatorial Characterization of the Testable Graph Properties: It’s All About Regularity
A common thread in all the recent results concerning testing dense graphs is the use of Szemerédi’s regularity lemma. In this paper we show that in some sense this is not a coincidence. Our first…
Publication