We study an election with two perfectly informed candidates. Voters share common values over the policy outcome of the election, but possess arbitrarily little information about which policy is best for them. Voters elect one of the candidates, effectively choosing between the two policies...

We consider full implementation in complete-information environments when agents have an arbitrarily small preference for honesty. We offer a condition called separable punishment and show that when it holds and there are at least two agents, any social choice function can be implemented by a...