The topics of Election Procedures and Voting Paradoxes have been formally studied by a
very large number of philosophers, mathematicians, economists, and political scientists …

We are interested in the fast computation of the exact value of integrals of polynomial
functions over convex polyhedra. We present speed-ups and extensions of the algorithms …

We describe the use of pyramid decomposition in Normaliz, a software tool for the
computation of Hilbert bases and enumerative data of rational cones and affine monoids …

The goal of this paper is to propose a comparison of four multi-winner voting rules, k-
Plurality, k-Negative Plurality, k-Borda, and Bloc. These four election methods are …

We describe several analytical results obtained in four candidates social choice elections
under the assumption of the Impartial Anonymous Culture. These include the Condorcet and …

Results from voting theory are increasingly used when dealing with collective decision
making in computational multiagent systems. An important and surprising phenomenon in …

Results from social choice theory are increasingly used to argue about collective decision
making in computational multiagent systems. A large part of the social choice literature …

The main purpose of this paper is to compute the theoretical likelihood of some electoral
outcomes under the impartial anonymous culture in four-candidate elections by using the …

We describe an algorithm for the computation of generalized (or weighted) Ehrhart series
based on Stanley decompositions as implemented in the offspring NmzIntegrate of …

Voting rule performances are sometimes evaluated according to their respective resistances
to allow profitable misrepresentation of individual preferences. This seems to be a hard task …