The Pareto cover problem

Bento Natura, Meike Neuwohner, Stefan Weltge

We introduce the problem of finding a set $B$ of $k$ points in $[0,1{]}^n$ such that the expected cost of the cheapest point in $B$ that dominates a random point from $[0,1{]}^n$ is mi…