In voting theory, analyzing the frequency of an event (e.g. a voting paradox), under some specific but widely used assumptions, is equivalent to computing the exact number of integer solutions in aâ€¦ (More)

We define a new class of games, which we qualify as congestion games with exact partition. These games constitute a subfamily of singleton congestion games for which the players are restricted toâ€¦ (More)

In this paper, we study the class of congestion games with playerspecific payoff functions introduced by Milchtaich in 1996, for which, he proved that they always possess a Nash equilibrium in pureâ€¦ (More)

A society facing a choice problem has also to choose the voting rule itself from a set of different possible voting rules. In such situations, the consequentialism property allows us to induceâ€¦ (More)

The main purpose of this paper is to estimate the probability of casting a decisive vote for a class or random electorate models encompassing the celebrated IC and IAC models. The emphasis is on theâ€¦ (More)