Tags
#arrows-impossibility-theorem #computation #proof #social-choice
Question
Outline Proof: (Arrow, 1951). When there are three or more alternatives, then every SWF that is weakly Paretian and IIA must be a dictatorship. Hint: use two important lemmas.
Prove Contagion Lemma using weak Pareto and IIA. Prove Splitting Lemma using Contagion Lemma, transitivity, weak Pareto and IIA. Apply Splitting Lemma multiple times.

Tags
#arrows-impossibility-theorem #computation #proof #social-choice
Question
Outline Proof: (Arrow, 1951). When there are three or more alternatives, then every SWF that is weakly Paretian and IIA must be a dictatorship. Hint: use two important lemmas.
?

Tags
#arrows-impossibility-theorem #computation #proof #social-choice
Question
Outline Proof: (Arrow, 1951). When there are three or more alternatives, then every SWF that is weakly Paretian and IIA must be a dictatorship. Hint: use two important lemmas.
Prove Contagion Lemma using weak Pareto and IIA. Prove Splitting Lemma using Contagion Lemma, transitivity, weak Pareto and IIA. Apply Splitting Lemma multiple times.
If you want to change selection, open document below and click on "Move attachment"

pdf

owner: rappatoni - (no access) - CompSocBook.pdf, p24

Summary

status measured difficulty not learned 37% [default] 0

No repetitions