Allocation aggregation for a finite valuation domain

Abstract

A decision problem in which the values of the decision variables must sum to a fixed positive real number s is called an "allocation problem," and the problem of aggregating the allocations of n experts the "allocation aggregation problem." Under two simple axiomatic restrictions on aggregation, the only acceptable allocation aggregation method is based on weighted arithmetic averaging (Lehrer and Wagner, Rational Consensus in Science and Society, 1981). In this note it is demonstrated that when the values assigned to the variables are restricted to a finite set (as is always the case in practice), the aforementioned axioms allow only dictatorial aggregation.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2010-03-19

Downloads
39 (#354,874)

6 months
2 (#658,980)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references