We consider the optimization problem of a campaign trying to win an election when facing aggregate uncertainty, where agentsʼ voting probabilities are uncertain. Even a small amount of uncertainty will in a large electorate eliminate many of counterintuitive results that arise when voting...

Nabil Al-Najjar (2008) showed how games with countably infinite player sets can be used to approximate games with large finite player sets. Unfortunately, we have found an error in the proof of Al-Najjarʼs Theorem 5. In this correction we discuss the error and offer two slightly weaker versions...