We characterize a range of Stochastic Dominance relations by means of finite systems of convex inequalities. For 'SD optimality' of degree N=1, 2, 3, 4 and 'SD efficiency' of degree N=2, 3, 4, 5, we obtain exact systems that can be implemented using Linear Programming or Convex Quadratic...

This paper presents the conditions required for a profile in order to never exhibit either the strong or the strict Borda paradoxes under all weighted scoring rules in three-candidate elections. The main particularity of our paper is that all the conclusions are extracted from the differences of...

In ordinal (probabilistic) assignment problems, each agent reports his preference rankings over objects and receives a lottery defined over those objects. A common efficiency notion, sd-efficiency, is obtained by extending the preference rankings to preferences over lotteries by means of...

We study the problem of determining memberships to the groups in a Boolean algebra. The Boolean algebra is composed of basic groups (e.g., “J” and “K”) and the other groups that are derived from basic groups through the conjunction, disjunction, or negation operations (e.g., “J and...