Solution as Set of Maximal Candidates

We suggest a solution for a coevolutionary optimization problem is the set of maximal elements of the pulled back ordering. This solution concept generalizes the Pareto non-dominated front used in MOO.
For rock-paper-scissors, the solution set is {rock, paper, scissors}. None of these strategies stands out as being better than the others.

We suggest a solution for a coevolutionary optimization problem is the set of maximal elements of the pulled back ordering. This solution concept generalizes the Pareto non-dominated front used in MOO.