Sökning: "Condorcet voting"
Hittade 4 avhandlingar innehållade orden Condorcet voting.
1. Topics in Hardness of Approximation and Social Choice Theory
Sammanfattning : Tools from Fourier analysis of Boolean functions have commonly been used to prove results both in hardness of approximation in computer science and in the study of voting schemes in social choice theory. In this thesis we consider various topics in both these contexts. LÄS MER
2. Applications of Gaussian Noise Stability in Inapproximability and Social Choice Theory
Sammanfattning : Gaussian isoperimetric results have recently played an important role in proving fundamental results in hardness of approximation in computer science and in the study of voting schemes in social choice theory. In this thesis we prove a generalization of a Gaussian isoperimetric result by Borell and show that it implies that the majority function is optimal in Condorcet voting in the sense that it maximizes the probability that there is a single candidate which the society prefers over all other candidates. LÄS MER
3. Democracy and the Common Good : A Study of the Weighted Majority Rule
Sammanfattning : In this study I analyse the performance of a democratic decision-making rule: the weighted majority rule. It assigns to each voter a number of votes that is proportional to her stakes in the decision. LÄS MER
4. The Uncertain Dichotomous Choice Model - Some Results
Sammanfattning : A probabilistic framework used in studying collective decision making is the uncertain dichotomous choice model. The model is essentially characterized by two components: the organizational structure and the voting process. LÄS MER