Computing Voting Rules with Elicited Incomplete Votes

Daniel Halpern, Safwan Hossain, Jamie Tucker-Foltz

Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m…