This paper studies a robust version of the classic surplus extraction problem, in which designer knows only that beliefs each type belong to some set, and designs mechanisms are suitable for all possible set. We derive necessary sufficient conditions full this setting, show these natural set-valued analogues convex independence condition identified by Crémer McLean ( 1985 , 1988 ). is neither g...