Before revision: Divide and Choose among two agents , and the Diminishing Share (DS) and Moving Knife (MK) algorithms among many, elicit parsimonious information to guarantee to each a Fair Share, worth at least 1/ n-th of the whole manna.
After revision: A basic test of fairness when we divide a manna of private items between n agents is the lowest welfare the rule guarantees to each agent, irrespective of others preferences. Two familiar examples are: the Equal Split Guarantee when the manna is divisible and preferences are convex; and 1/ n-th of the whole manna.