When optimizing an aggregate of several individual objective functions, it may be possible to decompose the set of individual objectives into groups across which there are no conflicting interests. It is shown that changes in an individual objective will affect those individuals, and only those individuals, whose objective is in potential conflict with the changed objective. Thus, in particular, each individual can affect every other individual if and only if the optimization problem is indecomposable - i.e. if and only if it is impossible to separate the individuals into groups across which there are no conflicting interests.
- aggregate optimization
- comparative statics
- sensitivity analysis
ASJC Scopus subject areas
- Sociology and Political Science
- Social Sciences(all)
- Statistics, Probability and Uncertainty