Combinatorial versus decision-theoretic components of impossibility theorems
β Scribed by David Makinson
- Publisher
- Springer US
- Year
- 1996
- Tongue
- English
- Weight
- 463 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0040-5833
No coin nor oath required. For personal study only.
β¦ Synopsis
We separate the purely combinatorial component of An'ow's Impossibility Theorem in the theory of collective preference from its decision-theoretic part, and likewise for the closely related result of Blair/Bordes/Kelly/Suzumura. Such a separation provides a particularly elegant proof of the former, via a new 'splitting theorem'.
π SIMILAR VOLUMES
In 1951, K.J. Arrow proved that, under certain assumptions, it is impossible to have group decisionmaking rules that satisfy reasonable conditions like symmetry. This Impossibility Theorem is often cited as a proof that reasonable group decision-making is impossible. We start our article by remarkin