18 citations · 22 across the 3 of their papers we have counts for
3 papers
Approximating Voting Rules from Truncated Ballots
Manel Ayadi, Nahla Ben amor, Jérôme Lang
Classical voting rules assume that ballots are complete preference orders over candidates. However, when the number of candidates is large enough, it is too costly to ask the voter…
Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference
Raouia Ayachi, Nahla Ben Amor, Salem Benferhat +1
Qualitative possibilistic networks, also known as min-based possibilistic networks, are important tools for handling uncertain information in the possibility theory frame- work. De…
On the Complexity of Decision Making in Possibilistic Decision Trees
Helene Fargier, Nahla Ben Amor, Wided Guezguez
When the information about uncertainty cannot be quantified in a simple, probabilistic way, the topic of possibilistic decision theory is often a natural one to consider. The devel…