int compare_to_archive(Solution s)
{
// any member, 1 if dominates any member, and 0 otherwise
int i = 0;
int result = 0;
while ((i < arclength) && (result != 1) && (result != -1))
{
if (equil.Equals("Pareto"))
result = compare_max_Pareto(m.obj, arc[i].obj, objectives);
else
result = compare_max_Nash(m.obj, arc[i].obj, objectives);
i++;
}
return (result);
}