View Proposal #157
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 157 |
|---|---|
| First Name | Irvin |
| Last Name | Hentzel |
| Institution | Iowa State University |
| Speaker Category | faculty |
| Title of Talk | Arrow's Hypotheses |
| Abstract | We prove three consequences of Arrow's Hypotheses. (1) If some of the ballots put x first and the rest put x last, then x has to be either first or last in the group ranking. (2) If the rankings of a with b match the rankings of c with d on each ballot, then the group ranking must also match the ranking of a with b and c with d. (3) The group ranking must match one of the ballots. This material was taken from "Three Brief Proofs of Arrow's Impossibility Theorem" by John Geanakoplos. The point of the talk is to show that the proofs are very elementary. The various strategies for voting are covered in many very elementary texts. Their discussion is directed towards with of the hypotheses the voting strategies violate. This talk shows how the hypotheses can be combined to directly obtain conclusions that do not seem as fundamentally fair as the original hypotheses. |
| Subject area(s) | Voting Strategies |
| Suitable for undergraduates? | Yes |
| Day Preference | |
| Computer Needed? | N |
| Bringing a laptop? | N |
| Overhead Needed? | Y |
| Software requests | |
| Special Needs | |
| Date Submitted | 2/28/2006 |
| Year | 2006 |