Exercise 4c: Pareto optima
for (r=0; rɚ r++) {
for (c=0; cɚ c++) {
equil=(m[r][c]>m[!r][c]) && (m[c][r]>m[!c][r]);
...
better=0;
for (i=0; jɚ i++)
for (j=0; jɚ j++)
if (!((i==r) && (j==c)))
if ((m[i][j]>=m[r][c]) && (m[j][i]>=m[c][r]))
better = 1;
// if better==0 then (r,c) is a Pareto optimum
}
return 0;
}
Previous slide
Next slide
Back to first slide
View graphic version