Aggregation of Structured Solutions
This chapter (Partially based on: Levin MS (2011) Aggregation of composite solutions: strategies, models, examples. Electronic preprint, 72 pp., Nov. 29, 2011. http://arxiv.org/abs/1111.6983 [cs.SE]) addresses aggregation problems for structured (i.e., modular) solutions (e.g., sets, rankings, trees, hierarchies). Several aggregation strategies are described: extension of substructure, compression of superstructure, combined strategy, and new design. Auxiliary problems for computing proximity or metric between/among structures (sets, strings/sequencies, trees, morphological structures) are studied. Median/consensus problems for aggregation of sets, rankings, trees, and morphological structures are described. Illustrative aggregation numerical examples correspond to the following: notebook, educational course, investment, student plan.