In voting theory, analyzing how frequent is an event (e.g. a voting paradox) is, under some specific but widely used assumptions, equivalent to computing the exact number of integer solutions in a system of linear constraints. Recently, some algorithms for computing this number have been...

When the number of players is small in a weighted majority voting game, it can occur that one of the players has no influence on the result of the vote, in spite of a strictly positive weight. Such a player is called a “dummy” player in game theory. The purpose of this paper is to...

We report in this note some results on the theoretical likelihood of Condorcet's Other Paradox in three alternative elections. This paradox occurs when we have a voting situation such that no Wheighted Scoring Rule (WSR) will select the Pairwise Majority Rule Winner as the WSR winner. We...