Abstract
Selection tasks generalize some well studied problems, such as collective coin flipping and leader election. We present new selection protocols in the full information model, and new negative results. In particular, when there are \math good players, we show a protocol that chooses a good leader with probability \math, and show that every leader election protocol has success probability \math, for every \math. Previously known protocols for this problem have success probability that is exponentially small in \math, and no nontrivial upper bounds on the success probability were known.