21 citations · 47 across the 14 of their papers we have counts for
4 papers · 1 filter
Probabilistic Inference of Winners in Elections by Independent Random Voters
Aviram Imber, Benny Kimelfeld
We investigate the problem of computing the probability of winning in an election where voter attendance is uncertain. More precisely, we study the setting where, in addition to a…
Algorithmic Techniques for Necessary and Possible Winners
Vishal Chakraborty, Theo Delemazure, Benny Kimelfeld +3
We investigate the practical aspects of computing the necessary and possible winners in elections over incomplete voter preferences. In the case of the necessary winners, we show h…
Computing the Extremal Possible Ranks with Incomplete Preferences
Aviram Imber, Benny Kimelfeld
Various voting rules are based on ranking the candidates by scores induced by aggregating voter preferences. A winner (respectively, unique winner) is a candidate who receives a sc…
The Complexity of Determining the Necessary and Possible Top-k Winners in Partial Voting Profiles
Aviram Imber, Benny Kimelfeld
When voter preferences are known in an incomplete (partial) manner, winner determination is commonly treated as the identification of the necessary and possible winners; these are…