We study the phase transition of the coalitional manipulation problem for generalized scoring rules. Previously it has been shown that, under some conditions on the distribution of votes, if the number of manipulators is o ( p n), where n is the number of voters, then the probability that a random prole is manipulable by the coalition goes to zero as the number of voters goes to innity, whereas if the number of manipulators is! ( p n), then the probability that a random prole is manipulable goes to one. Here we consider the critical window, where a coalition has size c p n, and we show that as c goes from zero to in nity, the limiting probability that a random prole is manipulable goes from zero to one in a smooth fashion, i.e., there is a ...
We study the formation of a ruling coalition in political environments. Each individual is endowed w...
Most work on manipulation assumes that all preferences are known to the manipulators. However, in m...
This thesis studies problems in applied probability using combinatorial techniques. The first part o...
We study the phase transition of the coalitional manipulation problem for generalized scoring rules....
We study the phase transition of the coalitional manipulation problem for generalized scoring rules....
To the memory of Murat Sertel Abstract: Assuming the IC conjecture, we show that, for any faithful s...
We investigate the problem of coalitional manipulation in elections, which is known to be hard in a ...
Since voting rules are prototypes for many aggregation procedures, they also illuminate problems fac...
We consider probabilistic voting procedures which map each feasible set of alternatives and each uti...
Tournament solution concepts, selecting winners based on a pairwise dominance relation are an import...
In voting problems where agents have lipschitz continuous utility functions on a multidimensional sp...
Social choice is the study of the issues arising when a population of individuals attempts to combin...
In voting problems where agents have well behaved (Lipschitz contin-uous) utility functions on a mul...
For centuries, it has been widely believed that the influence of a small coalition of voters is negl...
We study the formation of a ruling coalition in political environments. Each individual is endowed w...
We study the formation of a ruling coalition in political environments. Each individual is endowed w...
Most work on manipulation assumes that all preferences are known to the manipulators. However, in m...
This thesis studies problems in applied probability using combinatorial techniques. The first part o...
We study the phase transition of the coalitional manipulation problem for generalized scoring rules....
We study the phase transition of the coalitional manipulation problem for generalized scoring rules....
To the memory of Murat Sertel Abstract: Assuming the IC conjecture, we show that, for any faithful s...
We investigate the problem of coalitional manipulation in elections, which is known to be hard in a ...
Since voting rules are prototypes for many aggregation procedures, they also illuminate problems fac...
We consider probabilistic voting procedures which map each feasible set of alternatives and each uti...
Tournament solution concepts, selecting winners based on a pairwise dominance relation are an import...
In voting problems where agents have lipschitz continuous utility functions on a multidimensional sp...
Social choice is the study of the issues arising when a population of individuals attempts to combin...
In voting problems where agents have well behaved (Lipschitz contin-uous) utility functions on a mul...
For centuries, it has been widely believed that the influence of a small coalition of voters is negl...
We study the formation of a ruling coalition in political environments. Each individual is endowed w...
We study the formation of a ruling coalition in political environments. Each individual is endowed w...
Most work on manipulation assumes that all preferences are known to the manipulators. However, in m...
This thesis studies problems in applied probability using combinatorial techniques. The first part o...