On the practicality of optimal output mechanisms for co-optimization algorithms
Elena Popovici, Ezra Winston, Anthony Bucci · 2011
Co-optimization problems involve one or more search spaces and a means of assessing interactions between entities in these spaces. Assessing a potential solution requires aggregating in some way the outcomes of a very large or infinite number of such interactions. This layer of complexity presents difficulties for algorithm design that are not encountered in ordinary optimization. For example, what a co-optimization algorithm should output is not at all obvious.