1 citations · 2 across the 7 of their papers we have counts for
1 paper · 1 filter
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…