Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.



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.
Answer
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.
Answer
?

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.
Answer
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

statusnot learnedmeasured difficulty37% [default]last interval [days]               
repetition number in this series0memorised on               scheduled repetition               
scheduled repetition interval               last repetition or drill

Details

No repetitions


Discussion

Do you want to join discussion? Click here to log in or create user.