The likelihood of observing Condorcet's Paradox is known to be very low for elections with a
small number of candidates if voters' preferences on candidates reflect any significant …

In voting theory, analyzing the frequency of an event (eg. a voting paradox), under some
specific but widely used assumptions, is equivalent to computing the exact number of integer …

We present a plan to add loop nest optimizations in GCC based on polyhedral
representations of loop nests. We advocate a static analysis approach based on a hierarchy …

Computations with Barvinok's short rational generating functions are traditionally being
performed in the dual space, to avoid the combinatorial complexity of inclusion--exclusion …

We show that the multistage stochastic linear problem (MSLP) with an arbitrary cost
distribution is equivalent to an MSLP on a finite scenario tree. We establish this exact …

Committee selection rules are procedures selecting sets of candidates (committees) of a
given size on the basis of the preferences of the voters. Two natural extensions of the well …

We state an integer linear programming formulation for the unique characterization of
complete simple games, ie a special subclass of monotone Boolean functions. In order to …

For three-candidate elections, we compute under the Impartial Anonymous Culture
assumption, the conditional probabilities of the Absolute Majority Winner Paradox (AMWP) …

Abstract The Borda Effect, first introduced by Colman and Poutney (Behav Sci 23: 15–20,
1978), occurs in a preference aggregation process using the Plurality rule if given the …

We use Ehrhart polynomials to estimate the likelihood of each three-candidate social
ranking produced by pairwise majority rule assuming an even number of voters and the …