We introduce a new probability model, namely Impartial, Anonymous and Neutral Culture model (IANC), for sampling public preferences concerning a given set of alternatives. IANC treats public preferences through a class of preference profiles named roots, where both names of the voters and of the alternatives are immaterial. The general framework along with the theoretical formulation through group actions, an exact formula for the number of roots, and the description of a symbolic algebra package that allows for the generation of roots uniformly are presented. In order to be able to obtain uniform distribution of roots for large electorate size and high number of alternatives which lead to combinatorial explosions, the machinery we developed involves elements of symmetric functions and an application of the Dixon-Wilf algorithm. Using Monte-Carlo methods, the model we develop allows for a testbed that can be used to answer various questions about the properties and behaviors of anonymous and neutral social choice rules for large parameters. As applications of the method, the results of two MonteCarlo experiments are presented: the likelihood of the existence of Condorcet winners, and the probability of Condorcet and Plurality rules to choose the same winner.
1The Impartial, Anonymous and Neutral Culture Model: A
Probability Model for Sampling Public Preference StructuresAbstract We introduce a new probability model, namely Impartial, Anonymous and Neutral Culture model (IANC), for sampling public preferences concerning a given set of alternatives. IANC treats public preferences through a class of preference profiles named roots, where both names of the voters and of the alternatives are immaterial. The general framework along with the theoretical formulation through group actions, an exact formula for the number of roots, and the description of a symbolic algebra package that allows for the generation of roots uniformly are presented. In order to be able to obtain uniform distribution of roots for large electorate size and high number of alternatives which lead to combinatorial explosions, the machinery we developed involves elements of symmetric functions and an application of the Dixon-Wilf algorithm. Using Monte-Carlo methods, the model we develop allows for a testbed that can be used to answer various questions about the properties and behaviors of anonymous and neutral social choice rules for large parameters. As applications of the method, the results of two MonteCarlo experiments are presented: the likelihood of the existence of Condorcet winners, and the probability of Condorcet and Plurality rules to choose the same winner.