Committee Selection with Approval Voting and Hypercubes

In this paper we will examine elections of the following form: a committee of size k is to be electedwith two candidates running for each position. Each voter submits a ballot with his or her ideal committee, which generates their approval set. The approval sets of voters consist of committees that are “close” to their ideal preference. We define this notion of closeness with Hamming distance in a hypercube: the number of candidates by which a particular committee di

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.