Coin-flipping games immune against linear-sized coalitions

Abstract

It is proved that for every c < 1 there are perfect-information coin-flipping and leader-election games on n players in which no coalition of cn players can influence the outcome with probability greater than some universal constant times c. It is shown that a random protocol of a certain length has this property, and an explicit construction is given as well.