Computing the Best Policy That Survives a Vote

Andrei Constantinescu, Roger Wattenhofer

An assembly of $n$ voters needs to decide on $t$ independent binary issues. Each voter has opinions about the issues, given by a $t$-bit vector. Anscombe's paradox shows that a pol…