Instance-optimality in the noisy value-and comparison-model: accept, accept, strong accept: which papers get in?

Motivated by crowdsourced computation, peergrading, and recommendation systems, Braverman, Mao and Weinberg [7] studied the query and round complexity of fundamental problems such as finding the maximum (max), finding all elements above a certain value (threshold-v) or computing the top-k elements (Top-k) in a noisy environment.