ch112 - Since the paper only introduces the social choices...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Summary Computational complexity became a vital element of social choice. It is a new criterion and it protects the reliability of voting. The paper introduces an algorithm used in the voting scheme that takes a set of candidates and a set of preference orders. The output will be a set of winners. The authors explains what the computational complexity is. The paper introduces some voting schemes that can be easily manipulated. The Copeland voting scheme orders the candidates in terms of the number of contest pairs they win subtracted by the number they lose. This voting scheme needs merely polynomial time to determine the winner. To sum up, voting schemes should be easy to use and implement must be difficult to manipulate. These schemes should determine the winner in polynomial time period but they must be near impossible to abuse. Compare / Contrast
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Since the paper only introduces the social choices algorithms, the chapter compares and contrasts both social welfare and social choices functions. While the chapter discusses the plurality in a long manner, the paper just mentions in a few sentences. In conclusion, the paper and the chapter have some differences in introducing algorithms. The paper includes more calculations and formulas. The chapter has more explanatory definitions. Reading both of them will be a good source of understanding social welfare and choices. Questions 1. What are the parameters that make the algorithms difficult to manipulate? 2. What are the main differences between Copeland or second order Copeland? 3. What are the tradeoffs between a unreliable voting system with an algorithm hard to abuse and a reliable voting system with a weak algorithm?...
View Full Document

This note was uploaded on 04/19/2010 for the course CISC 800 taught by Professor Kd during the Spring '10 term at University of Delaware.

Ask a homework question - tutors are online